Submission #993832
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <map> #include <queue> using namespace std; int pairs[100000]; int non_pairs[100000]; map<int,int> nums; int main(){ int N,M; cin>>N>>M; for(int i=0;i<N;i++){ int X; cin>>X; nums[X]++; } for(auto n:nums){ int N=n.first%M; int C=n.second; if(C>1){ if(C%2){ non_pairs[N]++; C--; } pairs[N]+=C; }else{ non_pairs[N]++; } } // for(int i=0;i<M;i++){ // cout<<i<<' '<<non_pairs[i]<<' '<<pairs[i]<<endl; // } int ans=(non_pairs[0]+pairs[0])/2; for(int i=1;i<M;i++){ if(M%2==0&&i*2==M){ ans+=(non_pairs[i]+pairs[i])/2; non_pairs[i]=pairs[i]=0; continue; } if(non_pairs[i]>0){ int P=min(non_pairs[i],non_pairs[M-i]); ans+=P; non_pairs[i]-=P; non_pairs[M-i]-=P; // if(P)cout<<'P'<<P<<' '<<i<<' '<<M-i<<endl; if(non_pairs[i]>0&&pairs[M-i]>0){ int Q=min(non_pairs[i],pairs[M-i]); if(Q%2==0){ ans+=Q; non_pairs[i]-=Q; pairs[M-i]-=Q; }else{ ans+=Q; non_pairs[i]-=Q; pairs[M-i]-=Q+1; non_pairs[M-i]+=1; } // if(Q)cout<<'Q'<<Q<<' '<<i<<' '<<M-i<<endl; } } } // cout<<ans<<endl; for(int i=1;i<M;i++){ ans+=pairs[i]/2; } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | conf |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1768 Byte |
Status | AC |
Exec Time | 72 ms |
Memory | 5376 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 2 ms | 256 KB |
01-02.txt | AC | 64 ms | 3200 KB |
01-03.txt | AC | 64 ms | 3200 KB |
01-04.txt | AC | 64 ms | 3200 KB |
01-05.txt | AC | 64 ms | 3200 KB |
01-06.txt | AC | 64 ms | 3200 KB |
01-07.txt | AC | 63 ms | 3200 KB |
01-08.txt | AC | 64 ms | 3200 KB |
01-09.txt | AC | 64 ms | 3200 KB |
01-10.txt | AC | 65 ms | 3584 KB |
01-11.txt | AC | 65 ms | 3968 KB |
01-12.txt | AC | 35 ms | 256 KB |
01-13.txt | AC | 35 ms | 256 KB |
01-14.txt | AC | 72 ms | 4992 KB |
01-15.txt | AC | 71 ms | 4864 KB |
01-16.txt | AC | 72 ms | 4992 KB |
01-17.txt | AC | 72 ms | 4992 KB |
01-18.txt | AC | 71 ms | 4992 KB |
01-19.txt | AC | 71 ms | 4992 KB |
01-20.txt | AC | 72 ms | 5376 KB |
01-21.txt | AC | 43 ms | 384 KB |
01-22.txt | AC | 43 ms | 384 KB |
01-23.txt | AC | 43 ms | 384 KB |
01-24.txt | AC | 44 ms | 512 KB |
01-25.txt | AC | 43 ms | 640 KB |
01-26.txt | AC | 44 ms | 1152 KB |
01-27.txt | AC | 36 ms | 2944 KB |
01-28.txt | AC | 5 ms | 896 KB |
01-29.txt | AC | 3 ms | 384 KB |
01-30.txt | AC | 3 ms | 384 KB |
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | AC | 2 ms | 256 KB |