Submission #1174514
Source Code Expand
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
//0-899
int Z(int y, int x){
return 30 * y + x;
}
int main(){
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
//ios_base::sync_with_stdio(0); cin.tie(0);
int H,W,K,T;
bool cars[1000];
bool tmpcars[1000];
FOR(i, 0, 1000) cars[i] = tmpcars[i] = false;
//入力
cin>>H>>W>>K>>T;
int A[450],B[450],C[450],D[450];
FOR(i, 0, K){
cin>>A[i]>>B[i]>>C[i]>>D[i];
A[i]--;B[i]--;C[i]--;D[i]--;
cars[Z(A[i], B[i])] = tmpcars[Z(A[i], B[i])] = true;
//車があればtrue
}
int L = 50;
cout << L << endl;
FOR(t, 0, L){
//car i について
FOR(i, 0, K){
int y = A[i];
int x = B[i];
int goaly = C[i];
int goalx = D[i];
//cout << x << ":" << y << endl;
//下に行ける時y++
if(goaly>y && !cars[Z(y+1, x)] && !tmpcars[Z(y+1, x)]){
cout << 'D';
tmpcars[Z(y,x)] = false;
tmpcars[Z(y+1, x)] = true;
A[i]++;
}
//上に行ける時y--
else if(goaly<y && !cars[Z(y-1, x)] && !tmpcars[Z(y-1, x)]){
cout << 'U';
tmpcars[Z(y,x)] = false;
tmpcars[Z(y-1, x)] = true;
A[i]--;
}
//右に行ける時
else if(goalx>x && !cars[Z(y, x+1)] && !tmpcars[Z(y, x+1)]){
cout << 'R';
tmpcars[Z(y,x)] = false;
tmpcars[Z(y, x+1)] = true;
B[i]++;
}
//左に行ける時
else if(goalx<x && !cars[Z(y, x-1)] && !tmpcars[Z(y, x-1)]){
cout << 'L';
tmpcars[Z(y,x)] = false;
tmpcars[Z(y, x-1)] = true;
B[i]--;
}
//動けない
else cout << '-';
}
//更新
FOR(i, 0, 1000) cars[i] = tmpcars[i];
cout << endl;
}
}
Submission Info
Submission Time |
|
Task |
B - 日本橋大渋滞 |
User |
nenuon |
Language |
C++14 (GCC 5.4.1) |
Score |
4563 |
Code Size |
2488 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
256 KB |
Judge Result
Set Name |
test_01 |
test_02 |
test_03 |
test_04 |
test_05 |
test_06 |
test_07 |
test_08 |
test_09 |
test_10 |
test_11 |
test_12 |
test_13 |
test_14 |
test_15 |
test_16 |
test_17 |
test_18 |
test_19 |
test_20 |
test_21 |
test_22 |
test_23 |
test_24 |
test_25 |
test_26 |
test_27 |
test_28 |
test_29 |
test_30 |
Score / Max Score |
159 / 50000 |
150 / 50000 |
152 / 50000 |
158 / 50000 |
166 / 50000 |
157 / 50000 |
153 / 50000 |
163 / 50000 |
147 / 50000 |
146 / 50000 |
157 / 50000 |
157 / 50000 |
149 / 50000 |
157 / 50000 |
143 / 50000 |
159 / 50000 |
147 / 50000 |
145 / 50000 |
153 / 50000 |
152 / 50000 |
159 / 50000 |
152 / 50000 |
149 / 50000 |
141 / 50000 |
144 / 50000 |
151 / 50000 |
160 / 50000 |
138 / 50000 |
148 / 50000 |
151 / 50000 |
Status |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Set Name |
Test Cases |
test_01 |
subtask_01_01.txt |
test_02 |
subtask_01_02.txt |
test_03 |
subtask_01_03.txt |
test_04 |
subtask_01_04.txt |
test_05 |
subtask_01_05.txt |
test_06 |
subtask_01_06.txt |
test_07 |
subtask_01_07.txt |
test_08 |
subtask_01_08.txt |
test_09 |
subtask_01_09.txt |
test_10 |
subtask_01_10.txt |
test_11 |
subtask_01_11.txt |
test_12 |
subtask_01_12.txt |
test_13 |
subtask_01_13.txt |
test_14 |
subtask_01_14.txt |
test_15 |
subtask_01_15.txt |
test_16 |
subtask_01_16.txt |
test_17 |
subtask_01_17.txt |
test_18 |
subtask_01_18.txt |
test_19 |
subtask_01_19.txt |
test_20 |
subtask_01_20.txt |
test_21 |
subtask_01_21.txt |
test_22 |
subtask_01_22.txt |
test_23 |
subtask_01_23.txt |
test_24 |
subtask_01_24.txt |
test_25 |
subtask_01_25.txt |
test_26 |
subtask_01_26.txt |
test_27 |
subtask_01_27.txt |
test_28 |
subtask_01_28.txt |
test_29 |
subtask_01_29.txt |
test_30 |
subtask_01_30.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask_01_01.txt |
AC |
3 ms |
256 KB |
subtask_01_02.txt |
AC |
2 ms |
256 KB |
subtask_01_03.txt |
AC |
2 ms |
256 KB |
subtask_01_04.txt |
AC |
2 ms |
256 KB |
subtask_01_05.txt |
AC |
2 ms |
256 KB |
subtask_01_06.txt |
AC |
3 ms |
256 KB |
subtask_01_07.txt |
AC |
3 ms |
256 KB |
subtask_01_08.txt |
AC |
3 ms |
256 KB |
subtask_01_09.txt |
AC |
3 ms |
256 KB |
subtask_01_10.txt |
AC |
3 ms |
256 KB |
subtask_01_11.txt |
AC |
3 ms |
256 KB |
subtask_01_12.txt |
AC |
3 ms |
256 KB |
subtask_01_13.txt |
AC |
2 ms |
256 KB |
subtask_01_14.txt |
AC |
2 ms |
256 KB |
subtask_01_15.txt |
AC |
3 ms |
256 KB |
subtask_01_16.txt |
AC |
2 ms |
256 KB |
subtask_01_17.txt |
AC |
2 ms |
256 KB |
subtask_01_18.txt |
AC |
2 ms |
256 KB |
subtask_01_19.txt |
AC |
2 ms |
256 KB |
subtask_01_20.txt |
AC |
3 ms |
256 KB |
subtask_01_21.txt |
AC |
3 ms |
256 KB |
subtask_01_22.txt |
AC |
3 ms |
256 KB |
subtask_01_23.txt |
AC |
3 ms |
256 KB |
subtask_01_24.txt |
AC |
3 ms |
256 KB |
subtask_01_25.txt |
AC |
2 ms |
256 KB |
subtask_01_26.txt |
AC |
2 ms |
256 KB |
subtask_01_27.txt |
AC |
2 ms |
256 KB |
subtask_01_28.txt |
AC |
3 ms |
256 KB |
subtask_01_29.txt |
AC |
3 ms |
256 KB |
subtask_01_30.txt |
AC |
2 ms |
256 KB |