Submission #409009
Source Code Expand
#include <iostream> int main() { int R, C, K; std::cin >> R >> C >> K; int N; std::cin >> N; int ame[N][2]; for(int i=0; i<N; ++i) { std::cin >> ame[i][0] >> ame[i][1]; } int result = 0; for(int i=1; i<=R; ++i) { for(int j=1; j<=C; ++j) { int sum = 0; for(int a=0;a<N;++a) { if(i == ame[a][0] || j == ame[a][1]) ++sum; } if(sum == K) ++result; } } std::cout << result << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | yoneeeee |
Language | C++ (GCC 4.9.2) |
Score | 30 |
Code Size | 607 Byte |
Status | TLE |
Exec Time | 2038 ms |
Memory | 1704 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt |
Subtask1 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.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 |
Subtask2 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.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, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 26 ms | 924 KB |
subtask0-sample02.txt | AC | 24 ms | 796 KB |
subtask0-sample03.txt | AC | 25 ms | 792 KB |
subtask1-01.txt | AC | 24 ms | 924 KB |
subtask1-02.txt | AC | 25 ms | 796 KB |
subtask1-03.txt | AC | 26 ms | 672 KB |
subtask1-04.txt | AC | 26 ms | 800 KB |
subtask1-05.txt | AC | 26 ms | 800 KB |
subtask1-06.txt | AC | 27 ms | 796 KB |
subtask1-07.txt | AC | 24 ms | 672 KB |
subtask1-08.txt | AC | 26 ms | 804 KB |
subtask1-09.txt | AC | 25 ms | 804 KB |
subtask1-10.txt | AC | 25 ms | 804 KB |
subtask1-11.txt | AC | 25 ms | 928 KB |
subtask1-12.txt | AC | 26 ms | 804 KB |
subtask1-13.txt | AC | 26 ms | 796 KB |
subtask1-14.txt | AC | 25 ms | 796 KB |
subtask1-15.txt | AC | 25 ms | 804 KB |
subtask2-01.txt | AC | 584 ms | 796 KB |
subtask2-02.txt | AC | 1835 ms | 796 KB |
subtask2-03.txt | TLE | 2034 ms | 1060 KB |
subtask2-04.txt | TLE | 2034 ms | 1696 KB |
subtask2-05.txt | TLE | 2034 ms | 1704 KB |
subtask2-06.txt | TLE | 2034 ms | 1700 KB |
subtask2-07.txt | TLE | 2036 ms | 1704 KB |
subtask2-08.txt | TLE | 2034 ms | 1692 KB |
subtask2-09.txt | TLE | 2038 ms | 1612 KB |
subtask2-10.txt | TLE | 2033 ms | 1688 KB |
subtask2-11.txt | TLE | 2034 ms | 1696 KB |
subtask2-12.txt | TLE | 2033 ms | 1516 KB |
subtask2-13.txt | TLE | 2034 ms | 1704 KB |
subtask2-14.txt | TLE | 2034 ms | 1700 KB |
subtask2-15.txt | TLE | 2033 ms | 1704 KB |