Submission #992569
Source Code Expand
#include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <vector> #include <cstring> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <algorithm> using namespace std; #define REP(i,n) for(int i=0; i<n; ++i) #define FOR(i,a,b) for(int i=a; i<=b; ++i) #define FORR(i,a,b) for (int i=a; i>=b; --i) #define pi M_PI typedef long long ll; typedef vector<int> VI; typedef vector<ll> VL; typedef vector<VI> VVI; typedef pair<int,int> P; typedef pair<ll,ll> PL; const int N = 100001; int main() { int n, m; cin >> n >> m; VI x(n); REP(i,n) scanf("%d", &x[i]); VI p(N), a(m), b(m); REP(i,n) p[x[i]]++; REP(i,N){ a[i%m] += p[i]; b[i%m] += p[i]/2; } int ans = 0; REP(i,m/2+1){ int j = (m-i) % m; if (i == j){ ans += a[i]/2; }else{ int y = min(a[i], a[j]); ans += y; if (a[i] > a[j]) { ans += min((a[i]-y)/2, b[i]); }else{ ans += min((a[j]-y)/2, b[j]); } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | TangentDay |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1216 Byte |
Status | AC |
Exec Time | 15 ms |
Memory | 1792 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:33:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] REP(i,n) scanf("%d", &x[i]); ^
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 | 4 ms | 640 KB |
01-02.txt | AC | 13 ms | 1024 KB |
01-03.txt | AC | 13 ms | 1024 KB |
01-04.txt | AC | 13 ms | 1024 KB |
01-05.txt | AC | 13 ms | 1024 KB |
01-06.txt | AC | 13 ms | 1024 KB |
01-07.txt | AC | 13 ms | 1024 KB |
01-08.txt | AC | 13 ms | 1024 KB |
01-09.txt | AC | 13 ms | 1024 KB |
01-10.txt | AC | 14 ms | 1280 KB |
01-11.txt | AC | 15 ms | 1792 KB |
01-12.txt | AC | 13 ms | 1024 KB |
01-13.txt | AC | 14 ms | 1408 KB |
01-14.txt | AC | 13 ms | 1024 KB |
01-15.txt | AC | 13 ms | 1024 KB |
01-16.txt | AC | 13 ms | 1024 KB |
01-17.txt | AC | 13 ms | 1024 KB |
01-18.txt | AC | 13 ms | 1024 KB |
01-19.txt | AC | 13 ms | 1152 KB |
01-20.txt | AC | 14 ms | 1792 KB |
01-21.txt | AC | 13 ms | 1024 KB |
01-22.txt | AC | 13 ms | 1024 KB |
01-23.txt | AC | 13 ms | 1024 KB |
01-24.txt | AC | 13 ms | 1024 KB |
01-25.txt | AC | 14 ms | 1280 KB |
01-26.txt | AC | 14 ms | 1792 KB |
01-27.txt | AC | 10 ms | 1664 KB |
01-28.txt | AC | 5 ms | 1408 KB |
01-29.txt | AC | 4 ms | 896 KB |
01-30.txt | AC | 5 ms | 1408 KB |
sample-01.txt | AC | 4 ms | 640 KB |
sample-02.txt | AC | 3 ms | 640 KB |