Submission #1536292
Source Code Expand
import sequtils,strutils
var
R,C,M : int
(R, C, M) = stdin.readline.split.map(parseInt)
var
N = stdin.readline.parseInt
r1,r2,c1,c2 : int
ans = newSeq[int](0)
hyou : array[52, array[52, int]]
T : array[5001, array[4, int]]
K : int
for n in 1..N:
(r1,r2,c1,c2) = stdin.readline.split.map(parseInt)
T[n] = [r1,r2,c1,c2]
hyou[r1][c1] += 1
hyou[r2 + 1][c1] -= 1
hyou[r1][c2 + 1] -= 1
hyou[r2 + 1][c2 + 1] += 1
for r in 1..R:
for c in 1..C:
hyou[r][c] += hyou[r - 1][c] + hyou[r][c - 1] - hyou[r - 1][c - 1]
if hyou[r][c] mod 4 == 0:
K += 1
for n,t in T[1..N]:
(r1,r2,c1,c2) = (t[0],t[1],t[2],t[3])
var cnt = 0
for r in r1..r2:
for c in c1..c2:
if hyou[r][c] mod 4 == 0:
cnt -= 1
elif hyou[r][c] mod 4 == 1:
cnt += 1
if cnt == (M - K):
echo n + 1
Submission Info
Submission Time
2017-08-24 19:58:24+0900
Task
E - 儀式
User
s496t
Language
Nim (0.13.0)
Score
100
Code Size
946 Byte
Status
AC
Exec Time
12 ms
Memory
640 KB
Compile Error
Hint: system [Processing]
Hint: Main [Processing]
Hint: sequtils [Processing]
Hint: strutils [Processing]
Hint: parseutils [Processing]
Main.nim(8, 5) Hint: 'ans' is declared but not used [XDeclaredButNotUsed]
Hint: [Link]
Hint: operation successful (12961 lines compiled; 1.911 sec total; 14.143MB; Release Build) [SuccessX]
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 100
Status
Set Name
Test Cases
Sample
subtask0-sample-01.txt, subtask0-sample-02.txt
All
subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt, subtask1-27.txt, subtask1-28.txt, subtask1-29.txt, subtask1-30.txt
Case Name
Status
Exec Time
Memory
subtask0-sample-01.txt
AC
1 ms
256 KB
subtask0-sample-02.txt
AC
1 ms
256 KB
subtask1-01.txt
AC
1 ms
256 KB
subtask1-02.txt
AC
1 ms
256 KB
subtask1-03.txt
AC
1 ms
256 KB
subtask1-04.txt
AC
1 ms
384 KB
subtask1-05.txt
AC
2 ms
384 KB
subtask1-06.txt
AC
3 ms
512 KB
subtask1-07.txt
AC
3 ms
512 KB
subtask1-08.txt
AC
6 ms
640 KB
subtask1-09.txt
AC
9 ms
640 KB
subtask1-10.txt
AC
8 ms
640 KB
subtask1-11.txt
AC
10 ms
640 KB
subtask1-12.txt
AC
3 ms
384 KB
subtask1-13.txt
AC
5 ms
384 KB
subtask1-14.txt
AC
6 ms
512 KB
subtask1-15.txt
AC
9 ms
512 KB
subtask1-16.txt
AC
11 ms
640 KB
subtask1-17.txt
AC
9 ms
640 KB
subtask1-18.txt
AC
8 ms
640 KB
subtask1-19.txt
AC
11 ms
640 KB
subtask1-20.txt
AC
11 ms
640 KB
subtask1-21.txt
AC
11 ms
640 KB
subtask1-22.txt
AC
11 ms
640 KB
subtask1-23.txt
AC
11 ms
640 KB
subtask1-24.txt
AC
11 ms
640 KB
subtask1-25.txt
AC
8 ms
640 KB
subtask1-26.txt
AC
12 ms
640 KB
subtask1-27.txt
AC
11 ms
640 KB
subtask1-28.txt
AC
9 ms
640 KB
subtask1-29.txt
AC
11 ms
640 KB
subtask1-30.txt
AC
11 ms
640 KB