| Task: | Spiraali |
| Sender: | Kargeri |
| Submission time: | 2021-10-07 16:26:35 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 35 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 15 |
| #2 | ACCEPTED | 20 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1 | details |
| #2 | ACCEPTED | 0.01 s | 2 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>
using namespace std;
int main()
{
int n, t, x, y, r, iar, b, ns;
cin >> n;
cin >> t;
int* results = new int[t];
ns = n * n;
for (int j = 0; j < t; j++)
{
cin >> y;
cin >> x;
r = 0;
for (int i = 0; i < n / 2; i++)
{
if (x == i + 1 or x == n - i or y == i + 1 or y == n - i)
{
r = i + 1;
break;
}
}
iar = n - (r - 1) * 2;
b = ns - iar * iar + 1;
if (x == 1 and y == 1)
{
results[j] = 1;
}
else if (x == r)
{
results[j] = b + y - r;
}
else if (y == n - r + 1)
{
results[j] = b + iar - 1 + x - r;
}
else if (x == n - r + 1)
{
results[j] = b + iar * 2 - 2 + n - y - r + 1;
}
else if (y == r)
{
results[j] = b + iar * 3 - 3 + n - x - r + 1;
}
}
for (int i = 0; i < t; i++)
{
cout << results[i] << endl;
}
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 100 1 1 1 2 1 3 1 4 ... |
| correct output |
|---|
| 1 36 35 34 33 ... |
| user output |
|---|
| 1 36 35 34 33 ... Truncated |
Test 2
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1000 371 263 915 322 946 880 53 738 ... |
| correct output |
|---|
| 773533 312166 206053 200080 593922 ... |
| user output |
|---|
| 773533 312166 206053 200080 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) |
