Submission #2660471
Source Code Expand
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
int main()
{
int r, c, k;
int n;
scanf("%d %d %d", &r, &c, &k);
scanf("%d", &n);
int x[100000]={}, y[100000]={};
multimap<int, int> mp;
for(int i=0; i<n; i++){
int r1, c1;
scanf("%d %d", &r1, &c1);
r1--;
c1--;
x[r1]++;
y[c1]++;
mp.insert(make_pair(r1, c1));
}
int ys[100000];
for(int i=0; i<c; i++){
ys[i]=y[i];
}
sort(ys, ys+c);
ll ans=0;
for(int i=0; i<r; i++){
for(auto itr=mp.lower_bound(i); itr!=mp.upper_bound(i); itr++){
if(x[i]+y[itr->second]==k) ans--;
if(x[i]+y[itr->second]-1==k) ans++;
}
ans+=((ll)(upper_bound(ys, ys+c, k-x[i])-lower_bound(ys, ys+c, k-x[i])));
}
printf("%lld\n", ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 収集王 |
User |
chocorusk |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
963 Byte |
Status |
AC |
Exec Time |
85 ms |
Memory |
6144 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:20:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &r, &c, &k);
^
./Main.cpp:21:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:26:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &r1, &c1);
^
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 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 |
2 ms |
1024 KB |
subtask0-sample02.txt |
AC |
2 ms |
1024 KB |
subtask0-sample03.txt |
AC |
2 ms |
1024 KB |
subtask1-01.txt |
AC |
2 ms |
1024 KB |
subtask1-02.txt |
AC |
2 ms |
1024 KB |
subtask1-03.txt |
AC |
2 ms |
1024 KB |
subtask1-04.txt |
AC |
2 ms |
1024 KB |
subtask1-05.txt |
AC |
2 ms |
1024 KB |
subtask1-06.txt |
AC |
2 ms |
1024 KB |
subtask1-07.txt |
AC |
2 ms |
1024 KB |
subtask1-08.txt |
AC |
2 ms |
1024 KB |
subtask1-09.txt |
AC |
2 ms |
1024 KB |
subtask1-10.txt |
AC |
2 ms |
1024 KB |
subtask1-11.txt |
AC |
2 ms |
1024 KB |
subtask1-12.txt |
AC |
2 ms |
1024 KB |
subtask1-13.txt |
AC |
2 ms |
1024 KB |
subtask1-14.txt |
AC |
2 ms |
1024 KB |
subtask1-15.txt |
AC |
2 ms |
1024 KB |
subtask2-01.txt |
AC |
2 ms |
1024 KB |
subtask2-02.txt |
AC |
3 ms |
1152 KB |
subtask2-03.txt |
AC |
15 ms |
2432 KB |
subtask2-04.txt |
AC |
52 ms |
6144 KB |
subtask2-05.txt |
AC |
60 ms |
6144 KB |
subtask2-06.txt |
AC |
79 ms |
6144 KB |
subtask2-07.txt |
AC |
54 ms |
5760 KB |
subtask2-08.txt |
AC |
83 ms |
6144 KB |
subtask2-09.txt |
AC |
82 ms |
6144 KB |
subtask2-10.txt |
AC |
85 ms |
6144 KB |
subtask2-11.txt |
AC |
78 ms |
6144 KB |
subtask2-12.txt |
AC |
80 ms |
6144 KB |
subtask2-13.txt |
AC |
78 ms |
6144 KB |
subtask2-14.txt |
AC |
78 ms |
6144 KB |
subtask2-15.txt |
AC |
82 ms |
6144 KB |