# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83349 | charlies_moo | Spirale (COCI18_spirale) | C++17 | 42 ms | 676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cstring>
int main() {
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
int a[155][155];
memset(a, 0, sizeof(a));
int dx[2][4] = {{-1, 0, 1, 0}, {-1, 0, 1, 0}};
int dy[2][4] = {{0, 1, 0, -1}, {0, -1, 0, 1}};
for (int i = 0; i < k; i++) {
int x, y, t;
scanf("%d %d %d", &x, &y, &t);
x += 50, y += 50;
int q = 1, r = 0;
while (q < 101 * 101) {
for (int j = 0; j < (r+2)/2; j++) {
if (a[x][y] == 0 || q < a[x][y]) {
a[x][y] = q;
}
x += dx[t][r%4];
y += dy[t][r%4];
q++;
}
r++;
}
}
for (int i = 51; i < 51 + n; i++) {
for (int j = 51; j < 51 + m; j++) {
printf("%d%c", a[i][j], j == 50 + m ? '\n' : ' ');
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |