Submission #993493
Source Code Expand
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define P(p) cout<<(p)<<endl;
#define VEC_2D(a,b) vector<vector<int> >(a, vector<int>(b, 0))
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define INF (1100000000)
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MOD 1000000007LL
#define FSP(a) cout << fixed << setprecision(a)
ll gcd(ll x, ll y) {
if (y == 0) return x;
else return gcd(y, x%y);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
bool is_prime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return n != 1;
}
map<int, int> prime_factor(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1) res[n] = 1;
return res;
}
int extgcd(int a, int b, int& x, int& y) {//
int d = a;
if (b != 0) {
d = extgcd(b, a%b, y, x);
y -= (a / b)*x;
}
else {
x = 1; y = 0;
}
return d;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0) return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1) res = res * x % mod;
return res;
}
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
bool is_kadomatsu(int a, int b, int c) {
if (a == b || a == c || b == c)return false;
if (a > b && c > b) return true;
if (a < b && c < b)return true;
return false;
}
struct UF {
int n;
vi d;
UF() {}
UF(int n) :n(n), d(n, -1) {}
int root(int v) {
if (d[v] < 0) return v;
return d[v] = root(d[v]);
}
bool unite(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (size(x) < size(y)) swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
int size(int v) { return -d[root(v)]; }
};
vector<int> divisor(int n) {
if (n == 1) return{};
vi res;
for (int i = 1; i*i <= n; i++) {
if (n%i == 0) {
res.emplace_back(i);
if (i != 1 && i != n / i)res.emplace_back(n / i);
}
}
return res;
}
//-------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vi mod_num(M, 0);//枚数
vi mod_pair(M, 0);//ペア数
vi c(100005, 0);
rep(i, N) {
int a;
cin >> a;
int mod_a = a%M;
mod_num[mod_a]++;
if (c[a] == 1) {
c[a] = 0;
mod_pair[mod_a]++;
}
else {
c[a] = 1;
}
}
int ans = 0;
for (int i = 0; i <= M/ 2; i++) {
if (i == 0) {
ans += mod_num[i] / 2;
}else
if (i * 2 == M) {
ans += mod_num[i] / 2;
}
else {
int a = i;
int b = M - a;
int bai = min(mod_num[a], mod_num[b]);
ans += bai;
if (mod_num[a] > mod_num[b]) {
ans += min(mod_pair[a], (mod_num[a] - bai) / 2);
}
else {
ans += min(mod_pair[b], (mod_num[b] - bai) / 2);
}
}
}
P(ans);
return 0;
}
/*
int N, M;
cin >> N >> M;
UF uf(N);
map<int,vi> t;
rep(i, N) {
int K;
cin >> K;
rep(j, K) {
int a;
cin >> a;
for (int p : t[a]) {
uf.unite(p, i);
}
t[a].push_back(i);
}
}
if (uf.size(0) == N) {
P("YES");
}
else {
P("NO");
}
return 0;*/
//ifstream ifs("soc-LiveJournal1.txt"); //グラフの読み込み
//ofstream output("soc-LiveJournal2.txt");
//int u, v;
//string s;
//bool is_0_start = false;
//int count = 0;
//rep(i, 4) getline(ifs, s);
//for (; ifs >> u >> v;) {
// if (u == 0) is_0_start = true;
// if (!is_0_start) {
// u--;
// v--;
// }
// count++;
// if(count%10000==0)cout << count << endl;
// output << u << " " << v << endl;
//}
Submission Info
Submission Time |
|
Task |
D - Pair Cards |
User |
kou |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
5083 Byte |
Status |
AC |
Exec Time |
14 ms |
Memory |
1408 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 |
3 ms |
640 KB |
01-02.txt |
AC |
11 ms |
640 KB |
01-03.txt |
AC |
12 ms |
640 KB |
01-04.txt |
AC |
12 ms |
640 KB |
01-05.txt |
AC |
12 ms |
640 KB |
01-06.txt |
AC |
12 ms |
640 KB |
01-07.txt |
AC |
12 ms |
640 KB |
01-08.txt |
AC |
12 ms |
640 KB |
01-09.txt |
AC |
12 ms |
640 KB |
01-10.txt |
AC |
13 ms |
1024 KB |
01-11.txt |
AC |
14 ms |
1408 KB |
01-12.txt |
AC |
11 ms |
640 KB |
01-13.txt |
AC |
11 ms |
1024 KB |
01-14.txt |
AC |
11 ms |
640 KB |
01-15.txt |
AC |
11 ms |
640 KB |
01-16.txt |
AC |
11 ms |
640 KB |
01-17.txt |
AC |
11 ms |
640 KB |
01-18.txt |
AC |
11 ms |
640 KB |
01-19.txt |
AC |
11 ms |
768 KB |
01-20.txt |
AC |
13 ms |
1408 KB |
01-21.txt |
AC |
12 ms |
640 KB |
01-22.txt |
AC |
12 ms |
640 KB |
01-23.txt |
AC |
12 ms |
640 KB |
01-24.txt |
AC |
12 ms |
640 KB |
01-25.txt |
AC |
12 ms |
896 KB |
01-26.txt |
AC |
14 ms |
1408 KB |
01-27.txt |
AC |
8 ms |
1408 KB |
01-28.txt |
AC |
4 ms |
1408 KB |
01-29.txt |
AC |
3 ms |
1024 KB |
01-30.txt |
AC |
4 ms |
1408 KB |
sample-01.txt |
AC |
3 ms |
640 KB |
sample-02.txt |
AC |
3 ms |
640 KB |