Submission #402365
Source Code Expand
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <utility>
using namespace std;
int main(){
int r, c, k, n;
long ans=0;
set<pair<int,int> > candy;
int yoko[100000]={0}, tate[100000]={0};
int y[100000]={0}, t[100000]={0};
scanf(" %d %d %d %d", &r, &c, &k, &n);
for(int i=0; i<n; ++i){
int a, b;
scanf(" %d %d", &a, &b);
a--;
b--;
//飴のある位置を記録
candy.insert( make_pair(a, b) );
yoko[a]++;
tate[b]++;
}
for(int i=0; i<r; ++i) y[yoko[i]]++;
for(int i=0; i<c; ++i) t[tate[i]]++;
//for(int i=0; i<=k; ++i) printf("yoko[%d]=%d\n",i ,y[i]);
//for(int i=0; i<=k; ++i) printf("tate[%d]=%d\n", i, t[i]);
for(int i=0; i<=k; ++i) ans+=y[i]*t[k-i];
for(set<pair<int, int> >::iterator it=candy.begin(); it!=candy.end(); ++it){
int tmp=yoko[(*it).first]+tate[(*it).second];
if(tmp==k) ans--;
else if(tmp==k+1) ans++;
}
printf("%ld\n", ans);
}
Submission Info
Submission Time |
|
Task |
C - 収集王 |
User |
imulan |
Language |
C++ (GCC 4.9.2) |
Score |
30 |
Code Size |
1010 Byte |
Status |
WA |
Exec Time |
128 ms |
Memory |
7008 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d %d %d %d", &r, &c, &k, &n);
^
./Main.cpp:20:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d %d", &a, &b);
^
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 |
29 ms |
2332 KB |
subtask0-sample02.txt |
AC |
26 ms |
2460 KB |
subtask0-sample03.txt |
AC |
25 ms |
2456 KB |
subtask1-01.txt |
AC |
24 ms |
2460 KB |
subtask1-02.txt |
AC |
26 ms |
2464 KB |
subtask1-03.txt |
AC |
28 ms |
2340 KB |
subtask1-04.txt |
AC |
26 ms |
2464 KB |
subtask1-05.txt |
AC |
27 ms |
2272 KB |
subtask1-06.txt |
AC |
27 ms |
2464 KB |
subtask1-07.txt |
AC |
30 ms |
2332 KB |
subtask1-08.txt |
AC |
27 ms |
2268 KB |
subtask1-09.txt |
AC |
25 ms |
2464 KB |
subtask1-10.txt |
AC |
25 ms |
2328 KB |
subtask1-11.txt |
AC |
29 ms |
2328 KB |
subtask1-12.txt |
AC |
29 ms |
2332 KB |
subtask1-13.txt |
AC |
26 ms |
2340 KB |
subtask1-14.txt |
AC |
28 ms |
2460 KB |
subtask1-15.txt |
AC |
27 ms |
2460 KB |
subtask2-01.txt |
AC |
29 ms |
2344 KB |
subtask2-02.txt |
AC |
30 ms |
2472 KB |
subtask2-03.txt |
AC |
51 ms |
3744 KB |
subtask2-04.txt |
WA |
97 ms |
6944 KB |
subtask2-05.txt |
AC |
121 ms |
6948 KB |
subtask2-06.txt |
AC |
125 ms |
7008 KB |
subtask2-07.txt |
AC |
119 ms |
7008 KB |
subtask2-08.txt |
AC |
126 ms |
7008 KB |
subtask2-09.txt |
AC |
126 ms |
6956 KB |
subtask2-10.txt |
AC |
125 ms |
6952 KB |
subtask2-11.txt |
AC |
128 ms |
6948 KB |
subtask2-12.txt |
AC |
125 ms |
6952 KB |
subtask2-13.txt |
WA |
125 ms |
6948 KB |
subtask2-14.txt |
AC |
127 ms |
7004 KB |
subtask2-15.txt |
AC |
125 ms |
6948 KB |