Submission #1173337
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define WIN_WIDTH (1900)
#define WIN_HEIGHT (900)
#define REP(i, s, n) for(int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair <int, int> ii;
int dy[4] = { 1, 0, -1, 0};
int dx[4] = { 0, -1, 0, 1};
string cmand = "RULD-";
// U, L, D, R
struct _data {
int fr;
int fc;
int f;
int d;
};
bool operator<(_data l, _data r) {
return l.f < r.f;
}
vector <vector <bool> > mp1(30, vector <bool>(30, false));
int is_way(int a, int b, int c, int d) {
bool flag1 = ((d - b) > (c - a));
bool flag2 = ((d - b) > -(c - a));
if(flag1 && flag2) return 0;
else if(flag1 && !flag2) return 1;
else if(!flag1 && !flag2) return 2;
else if(!flag1 && flag2) return 3;
else return 4;
}
bool Area(int x, int y) {
return 0 <= x && x < 30 && 0 <= y && y < 30;
}
int main(){
int h, w, k, t;
cin >> h >> w >> k >> t;
rep(i, k){
int a, b, c, d;
cin >> a >> b >> c >> d;
}
cout << 1 << endl;
rep(i, k) cout << "-";
cout <<endl;
return 0;
}
/*
int main() {
int h, w, k, t;
cin >> h >> w >> k >> t;
vector <int> a(k), b(k), c(k), d(k);
rep(i, k) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
a[i]--;
b[i]--;
c[i]--;
d[i]--;
mp1[b[i]][a[i]] = true;
}
vector <vector <int> > cmd(t, vector <int>(k, 4));
int end_num = k;
rep(i, t) {
vector <bool> moved(k, false);
bool endFlag = true;
rep(j, k) {
if(!moved[j]) {
int way = is_way(a[j], b[j], c[j], d[j]);
if(way != 4 && Area(a[j] + dx[way], b[j] + dy[way]) && !mp1[b[j] + dy[way]][a[j] + dx[way]]) {
endFlag = false;
mp1[b[j]][a[j]] = false;
a[j] += dx[way];
b[j] += dy[way];
moved[j] = true;
cmd[i][j] = way;
mp1[b[j]][a[j]] = true;
}
}
}
if(endFlag){
end_num = i + 1;
break;
}
}
cout << end_num << endl;
rep(i, end_num){
rep(j, k) cout << cmand[cmd[i][j]];
cout << endl;
}
return 0;
}
*/
Submission Info
Submission Time |
|
Task |
B - 日本橋大渋滞 |
User |
letter |
Language |
C++14 (GCC 5.4.1) |
Score |
3329 |
Code Size |
2176 Byte |
Status |
AC |
Exec Time |
2 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 |
114 / 50000 |
111 / 50000 |
114 / 50000 |
116 / 50000 |
119 / 50000 |
112 / 50000 |
112 / 50000 |
116 / 50000 |
105 / 50000 |
109 / 50000 |
117 / 50000 |
109 / 50000 |
109 / 50000 |
111 / 50000 |
107 / 50000 |
115 / 50000 |
109 / 50000 |
110 / 50000 |
111 / 50000 |
110 / 50000 |
115 / 50000 |
110 / 50000 |
110 / 50000 |
108 / 50000 |
106 / 50000 |
110 / 50000 |
110 / 50000 |
104 / 50000 |
110 / 50000 |
110 / 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 |
2 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 |
2 ms |
256 KB |
subtask_01_07.txt |
AC |
2 ms |
256 KB |
subtask_01_08.txt |
AC |
2 ms |
256 KB |
subtask_01_09.txt |
AC |
2 ms |
256 KB |
subtask_01_10.txt |
AC |
2 ms |
256 KB |
subtask_01_11.txt |
AC |
2 ms |
256 KB |
subtask_01_12.txt |
AC |
2 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 |
2 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 |
2 ms |
256 KB |
subtask_01_21.txt |
AC |
2 ms |
256 KB |
subtask_01_22.txt |
AC |
2 ms |
256 KB |
subtask_01_23.txt |
AC |
2 ms |
256 KB |
subtask_01_24.txt |
AC |
2 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 |
2 ms |
256 KB |
subtask_01_29.txt |
AC |
2 ms |
256 KB |
subtask_01_30.txt |
AC |
2 ms |
256 KB |