Submission #1799277
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> P; typedef pair<int,P> P1; typedef pair<P,P> P2; #define pu push #define pb push_back #define mp make_pair #define eps 1e-7 #define INF 1000000000 #define mod 1000000007 #define fi first #define sc second #define rep(i,x) for(int i=0;i<x;i++) #define repn(i,x) for(int i=1;i<=x;i++) #define SORT(x) sort(x.begin(),x.end()) #define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) #define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) #define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) int n,m,a[100005],cnt[100005],cnt2[100005],gen[100005],ans; int main(){ cin>>n>>m; rep(i,n){ cin>>a[i]; cnt[a[i]%m]++; cnt2[a[i]]++; } for(int i=0;i<=100000;i++){ if(cnt2[i] >= 2){ gen[i%m] += cnt2[i]/2; } } for(int i=0;i<=m/2;i++){ int x = cnt[i]; int y = cnt[(m-i)%m]; if(i == (m-i)%m){ ans += x/2; } else{ if(x == y){ ans += x; } else if(x > y){ if(x-gen[i]*2 <= y){ ans += (x+y)/2; } else{ ans += gen[i] + y; } } else{ if(y-gen[(m-i)%m]*2 <= x){ ans += (x+y)/2; } else{ ans += gen[(m-i)%m] + x; } } } } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | IH19980412 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1296 Byte |
Status | AC |
Exec Time | 38 ms |
Memory | 1792 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt |
all | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 37 ms | 1024 KB |
01-03.txt | AC | 37 ms | 1024 KB |
01-04.txt | AC | 38 ms | 1024 KB |
01-05.txt | AC | 36 ms | 1024 KB |
01-06.txt | AC | 37 ms | 1024 KB |
01-07.txt | AC | 38 ms | 1024 KB |
01-08.txt | AC | 37 ms | 1024 KB |
01-09.txt | AC | 37 ms | 1024 KB |
01-10.txt | AC | 38 ms | 1408 KB |
01-11.txt | AC | 38 ms | 1792 KB |
01-12.txt | AC | 37 ms | 640 KB |
01-13.txt | AC | 37 ms | 640 KB |
01-14.txt | AC | 36 ms | 1024 KB |
01-15.txt | AC | 36 ms | 1024 KB |
01-16.txt | AC | 37 ms | 1024 KB |
01-17.txt | AC | 37 ms | 1024 KB |
01-18.txt | AC | 36 ms | 1024 KB |
01-19.txt | AC | 37 ms | 1024 KB |
01-20.txt | AC | 36 ms | 1408 KB |
01-21.txt | AC | 36 ms | 1024 KB |
01-22.txt | AC | 36 ms | 1024 KB |
01-23.txt | AC | 36 ms | 1024 KB |
01-24.txt | AC | 36 ms | 1024 KB |
01-25.txt | AC | 37 ms | 1280 KB |
01-26.txt | AC | 37 ms | 1792 KB |
01-27.txt | AC | 19 ms | 896 KB |
01-28.txt | AC | 3 ms | 1152 KB |
01-29.txt | AC | 2 ms | 768 KB |
01-30.txt | AC | 2 ms | 384 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |