| Task: | Spiraali |
| Sender: | eetul |
| Submission time: | 2021-10-06 21:56:55 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.01 s | 1 | details |
| #2 | WRONG ANSWER | 0.01 s | 2 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h>
#define MIN(X, Y) (((X) < (Y)) ? (X) : (Y))
#define MAX(X, Y) (((X) >= (Y)) ? (X) : (Y))
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, t, y, x;
cin >> n >> t;
while (t--) {
cin >> y >> x;
int r = 1;
int cy = 1;
int cx = 1;
int o = 1;
int f = 1;
while (1) {
// down
if (cx == x) {
r += (y - cy);
break;
}
else {
cy += (n - o);
r += (n - o);
}
// right
if (cy == y) {
r += (x - cx);
break;
}
else {
if (!f)
o++;
cx += (n - o);
r += (n - o);
}
// up
if (cx == x) {
r += (cy - y);
break;
}
else {
cy -= (n - o);
r += (n - o);
}
// left
if (cy == x) {
r += (x - cx);
break;
}
else {
o++;
f = 0;
cx -= (n - o);
r += (n - o);
}
}
cout << r << "\n";
}
return 0;
}
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 100 1 1 1 2 1 3 1 4 ... |
| correct output |
|---|
| 1 36 35 34 33 ... |
| user output |
|---|
| 1 36 63 82 93 ... Truncated |
Test 2
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1000 371 263 915 322 946 880 53 738 ... |
| correct output |
|---|
| 773533 312166 206053 200080 593922 ... |
| user output |
|---|
| 773533 312166 206053 775060 593922 ... Truncated |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000000000 1000 177757853 827347032 409613589 419171337 739269360 256524697 328695530 896842209 ... |
| correct output |
|---|
| 571375684522141210 967321186816598569 762879105851175000 370065046779516790 936897883750373771 ... |
| user output |
|---|
| (empty) |
