QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #673462 | #4328. Dugput | Qingyu | 0 | 1ms | 5884kb | C++23 | 654b | 2024-10-24 22:33:06 | 2024-10-24 22:43:52 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
const int dx[] = {-1, 0, 1, 0},
dy[] = {0, 1, 0, -1};
int vis[N][N];
string S;
int sx, sy, tx, ty;
void walk(int c) {
if (vis[sx + dx[c]][sy + dy[c]]++) return;
sx += dx[c], sy += dy[c], S += "URDL"[c];
}
char res[N << 1][N * 3];
signed main() {
int id, T; scanf("%d%d", &id, &T);
if (id<=4) id = 0;
else id = 1;
for (int C=1;C<=T;++C) {
int n, m, tsx, tsy;
scanf("%d%d%d%d%d%d", &n, &m, &sx, &sy, &tx, &ty);
if (C==1499){
printf("%d %d %d %d %d %d\n", n, m, sx, sy, tx, ty);
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 5884kb
input:
1 1562 15 6 1 6 15 1 15 6 5 6 11 1 15 6 15 2 1 5 15 6 1 6 1 3 15 6 15 6 11 6 15 6 1 1 4 2 15 6 2 1 9 2 15 6 4 5 9 4 15 6 4 5 4 6 15 6 9 2 3 2 15 6 9 2 6 5 2 41 1 41 2 1 2 41 1 24 2 9 2 41 2 2 1 10 2 41 1 1 1 14 2 41 2 1 1 10 2 41 2 16 2 17 2 41 1 28 2 35 2 41 2 9 1 36 2 41 1 18 ...
output:
5 6 2 5 3 6
result:
wrong answer invalid map: (1, 1) is 5, but it should be either o or * (test case 1)
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Wrong Answer
Test #5:
score: 0
Wrong Answer
time: 1ms
memory: 5848kb
input:
5 1562 165 500 1 500 165 500 165 500 78 500 1 401 165 500 165 469 104 500 165 500 1 1 165 298 165 500 165 1 1 499 165 500 165 1 4 122 165 500 8 1 85 361 165 500 112 191 152 254 165 500 112 191 114 190 165 500 49 106 64 350 165 500 49 106 48 108 22 500 22 500 22 1 22 500 20 1 1 387 22 ...
output:
5 6 4 6 5 3
result:
wrong answer read 5 but expected 82499 (test case 1)