Submission #1801473
Source Code Expand
#include <iostream> #include <fstream> #include <iomanip> #include <math.h> #include <limits.h> #include <algorithm> #include <vector> #include <list> #include <stack> #include <queue> #include <set> #include <map> #include <bitset> #include <string> #include <string.h> #include <sstream> #include <ctime> using namespace std; #define eps 1e-12 #define pi 3.14159265358979323846 #define pb push_back #define mp make_pair #define st first #define nd second #define bgn begin #define ll long long #define ld long double #define ull unsigned long long #define ii pair<ll,ll> const int N=1e5+10; ll n,m,x,c[N],c2[N],mn,mx,res; void solve() { cin>>n>>m; for(int i=0;i<=m;i++)c[i]=0; for(int i=1;i<=n;i++) { cin>>x; c[x%m]++; c2[x]++; } res=(c[0]/2); if(m%2==0)res+=c[m/2]/2; for(int i=1,j=m-1;i*2<m;i++,j--) { mn=min(c[i],c[j]); res+=mn; c[i]-=mn; c[j]-=mn; } for(int i=1;i+4<N;i++) { if(i%m==0||(i%m)*2==m)continue; mn=min(c[i%m]/2,c2[i]/2); res+=mn; c[i%m]-=mn*2; } cout<<res<<"\n"; } int main() { std::ios::sync_with_stdio(0); cin.tie(0); #ifdef localProject freopen("in.txt","r",stdin); #endif solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | mostafa_9a7c2 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1257 Byte |
Status | AC |
Exec Time | 12 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 | 2 ms | 256 KB |
01-02.txt | AC | 11 ms | 1024 KB |
01-03.txt | AC | 11 ms | 1024 KB |
01-04.txt | AC | 11 ms | 1024 KB |
01-05.txt | AC | 11 ms | 1024 KB |
01-06.txt | AC | 11 ms | 1024 KB |
01-07.txt | AC | 11 ms | 1024 KB |
01-08.txt | AC | 11 ms | 1024 KB |
01-09.txt | AC | 11 ms | 1024 KB |
01-10.txt | AC | 12 ms | 1408 KB |
01-11.txt | AC | 12 ms | 1792 KB |
01-12.txt | AC | 11 ms | 256 KB |
01-13.txt | AC | 11 ms | 640 KB |
01-14.txt | AC | 11 ms | 1024 KB |
01-15.txt | AC | 11 ms | 1024 KB |
01-16.txt | AC | 11 ms | 1024 KB |
01-17.txt | AC | 11 ms | 1024 KB |
01-18.txt | AC | 11 ms | 1024 KB |
01-19.txt | AC | 11 ms | 1152 KB |
01-20.txt | AC | 12 ms | 1792 KB |
01-21.txt | AC | 11 ms | 1024 KB |
01-22.txt | AC | 11 ms | 1024 KB |
01-23.txt | AC | 11 ms | 1024 KB |
01-24.txt | AC | 11 ms | 1024 KB |
01-25.txt | AC | 12 ms | 1280 KB |
01-26.txt | AC | 12 ms | 1792 KB |
01-27.txt | AC | 8 ms | 1408 KB |
01-28.txt | AC | 4 ms | 1792 KB |
01-29.txt | AC | 3 ms | 1280 KB |
01-30.txt | AC | 3 ms | 1024 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 2 ms | 256 KB |