Task: | Spiraali |
Sender: | Kargeri |
Submission time: | 2021-10-07 16:00:54 +0300 |
Language: | Python3 (CPython3) |
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.02 s | 1 | details |
#2 | ACCEPTED | 0.09 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
ip = input("") n = int(ip.split()[0]) t = int(ip.split()[1]) ns = n*n tests = [] for k in range(t): ip = input("").split() x = int(ip[1]) y = int(ip[0]) tests.append((x,y)) for test in tests: x = test[0] y = test[1] ring = 0 for i in range(int(n / 2)): if x == i + 1 or x == n - i or y == i + 1 or y == n - i: ring = i + 1 break inarow = n - (ring - 1) * 2 begin = ns - inarow ** 2 + 1 # begin = 4 + (int(n / 2) - ring + 1) * 8 if x == 1 and y == 1: print(1) elif x == ring: # print("we are on the left column") print(begin + y - ring) elif y == n - ring + 1: # print("we are on the bottom row") print(begin + inarow - 1 + x - ring) elif x == n - ring + 1: # print("we are on the right column") print(begin + inarow * 2 - 2 + n - y - ring + 1) elif y == ring: # print("we are on the top row") print(begin + inarow * 3 - 3 + n - x - ring + 1)
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) |