Submission #1484360
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
/*{{{*/ //template
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14;
constexpr double eps = 1e-10;
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/
constexpr int max_n = 100005;
int N,M;
vector<int> X;
int main(){
cin >> N >> M;
X.resize(M);
vector<int> cnt(M+10,0);
vector<int> cnt2(max_n,0);
vector<int> rem(M+10,0);
rep(i,M){
cin >> X[i];
cnt[X[i]%M]++;
cnt2[X[i]]++;
}
int ans = 0;
for(int i=0;i<M/2;i++){
int a = i;
int b = M - a;
if(a==b){
rem[a] = cnt[a];
continue;
}
int c = max(cnt[a],cnt[b]);
ans += c;
rem[a] = cnt[a]-c;
rem[b] = cnt[b]-c;
}
for(int i=0;i<M;i++){
int r = rem[i];
int sum = 0;
for(int v = i;v < max_n; v+=i){
int p = min(r/2,cnt2[v]/2);
sum += p;
r -= p*2;
if(r == 0 or r == 1) break;
}
ans += sum;
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
D - Pair Cards |
User |
chakku000 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2585 Byte |
Status |
WA |
Exec Time |
31 ms |
Memory |
1792 KB |
Judge Result
Set Name |
sample |
all |
Score / Max Score |
0 / 0 |
0 / 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 |
WA |
1 ms |
640 KB |
01-02.txt |
WA |
1 ms |
640 KB |
01-03.txt |
WA |
1 ms |
640 KB |
01-04.txt |
WA |
1 ms |
640 KB |
01-05.txt |
WA |
1 ms |
640 KB |
01-06.txt |
WA |
2 ms |
640 KB |
01-07.txt |
WA |
1 ms |
640 KB |
01-08.txt |
WA |
2 ms |
640 KB |
01-09.txt |
WA |
2 ms |
640 KB |
01-10.txt |
WA |
14 ms |
1152 KB |
01-11.txt |
WA |
31 ms |
1792 KB |
01-12.txt |
WA |
1 ms |
640 KB |
01-13.txt |
WA |
14 ms |
1152 KB |
01-14.txt |
WA |
1 ms |
640 KB |
01-15.txt |
WA |
1 ms |
640 KB |
01-16.txt |
WA |
2 ms |
640 KB |
01-17.txt |
WA |
2 ms |
640 KB |
01-18.txt |
WA |
3 ms |
640 KB |
01-19.txt |
WA |
6 ms |
768 KB |
01-20.txt |
WA |
31 ms |
1792 KB |
01-21.txt |
WA |
1 ms |
640 KB |
01-22.txt |
WA |
1 ms |
640 KB |
01-23.txt |
WA |
2 ms |
640 KB |
01-24.txt |
WA |
2 ms |
640 KB |
01-25.txt |
WA |
10 ms |
1024 KB |
01-26.txt |
WA |
30 ms |
1792 KB |
01-27.txt |
WA |
17 ms |
1792 KB |
01-28.txt |
WA |
4 ms |
1792 KB |
01-29.txt |
WA |
2 ms |
1152 KB |
01-30.txt |
WA |
3 ms |
1792 KB |
sample-01.txt |
AC |
1 ms |
640 KB |
sample-02.txt |
AC |
1 ms |
640 KB |