Submission #995990


Source Code Expand

#include "bits/stdc++.h"
using namespace std;

//諸機能
#pragma region MACRO 
#define putans(x)  std::cerr << "[ answer ]: " ; cout << (x) << endl
#define dputans(x) std::cerr << "[ answer ]: "; cout << setprecision(40) << (double)(x) << endl
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define RREP(i,n,a) for(int i=(int)(n-1); i>= a; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,n,0)
#define all(a) begin((a)),end((a))
#define mp make_pair
#define exist(container, n) ((container).find((n)) != (container).end())
#define equals(a,b) (fabs((a)-(b)) < EPS)
#ifdef _DEBUG //ファイルからテストデータを読み込む
std::ifstream ifs("data.txt");
#define put ifs >>
#else //ジャッジシステムでいい感じにやる
#define put cin >>
#endif
#pragma endregion
//デバッグなどの支援
#pragma region CODING_SUPPORT
#ifdef _DEBUG
#define dbg(var0) { std::cerr << ( #var0 ) << "=" << ( var0 ) << endl; }
#define dbg2(var0, var1) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; dbg(var1); }
#define dbg3(var0, var1, var2) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; dbg2(var1, var2); }
#define dbgArray(a,n) {std::cerr << (#a) << "=";  rep(i,n){std::cerr <<(a[i])<<",";} cerr<<endl;} 
#else
#define dbg(var0) {}
#define dbg2(var0, var1) {}
#define dbg3(var0, var1, var2) {}
#define dbgArray(a,n) {}
#endif 
#pragma endregion 
//typedef(書き換える、書き足す可能性ある)
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii; typedef pair<string, string> pss; typedef pair<int, string>pis;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
#pragma endregion
//諸々の定数(書き換える可能性ある)
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-10)
#define MOD (ll)(1e9 + 7)
#define INF (ll)(2*1e9)
#pragma endregion

//
////区間に対する演算を高速に求めるためのセグメント木
//	//int double とかのnumeric系に絞ったほうがよさげ
//	//n 要素数
//	//invalid_value 無効な数値 任意のaについてmarge(a,invalidvalue) = a, marge(invalid_value, a) = a となるような値
//class SegmentTreeLL {
//public:
//	SegmentTreeLL(int n, ll invalid_value);
//	~SegmentTreeLL();
//	void SetElem(int k, ll val);
//	int GetCount();
//	ll quary(int a, int b);
//	ll GetElem(int k);
//
//	//下の2つの関数をカスタマイズする
//	//invalid_valueを元に不正な数値かどうか調べる
//	bool IsInvalidValue(ll value) {
//		return value == mInvalidValue;
//	}
//	//aとbから a∪bを求める関数、自分で計算方法をここで決める
//	ll Marge(ll a, ll b) {
//		return min(a,b);
//	}
//private:
//	vector<ll>
//		mTree;
//	int mCount;
//	ll mInvalidValue;
//	void Update(int k, ll val);
//	ll InternalQuary(int a, int b, int k, int l, int r);
//};
//
////変更いらないはず
//SegmentTreeLL::SegmentTreeLL(int n, ll invalid_value) {
//	int bin_n = 1;
//	while (bin_n < n) bin_n *= 2;
//	mTree.resize(2 * bin_n);
//	mInvalidValue = invalid_value;
//	mCount = bin_n;
//	for (int i = 0; i < 2 * bin_n - 1; i++) {
//		mTree[i] = invalid_value;
//	}
//}
//SegmentTreeLL::~SegmentTreeLL() {
//}
//void SegmentTreeLL::SetElem(int k, ll val) { Update(k, val); }
//ll SegmentTreeLL::GetElem(int k) { return mTree[mCount - 1 + k]; }
//int SegmentTreeLL::GetCount() { return mCount; }
////値の更新
//void SegmentTreeLL::Update(int k, ll val) {
//	k += mCount - 1;
//	mTree[k] = val;
//	while (k > 0) {
//		k = ( k - 1 ) / 2;
//		mTree[k] = Marge(mTree[2 * k + 1], mTree[2 * k + 2]);
//	}
//}
////区間[a,b]の値をO(ln(Count))で求める b < GetCountとすること
////ex. a = 0 , b = 2 なら 0,1,2の区間
//ll SegmentTreeLL::quary(int a, int b) {
//	return InternalQuary(a, b + 1, 0, 0, mCount);
//}
////内部の処理
//ll SegmentTreeLL::InternalQuary(int a, int b, int k, int l, int r) {
//	if (r <= a || b <= l)return mInvalidValue;
//	if (a <= l && r <= b)return mTree[k];
//	else {
//		int vl = InternalQuary(a, b, k * 2 + 1, l, ( l + r ) / 2);
//		int vr = InternalQuary(a, b, k * 2 + 2, ( l + r ) / 2, r);
//		return Marge(vl, vr);
//	}
//}
////ここまで変更不要
//
//
//const static int MAX_V = 10000;
//
//vector<int> G[MAX_V];
//int root = 0;
//
//int vs[MAX_V * 2 - 1];
//SegmentTreeLL depth(2*16-1,INF);
//int id[MAX_V];
//
//void dfs(int v, int p, int d, int &k) {
//	id[v] = k;
//	vs[k] = v;
//	depth.SetElem(k++, d);
//	rep(i, G[v].size()) {
//		if (G[v][i] != p) {
//			dfs(G[v][i], v, d + 1, k);
//			vs[k] = v;
//			depth.SetElem(k++, d);
//		}
//	}
//}
////
//void init(int V) {
//	int k = 0;
//	dfs(root,-1,0,k);
//}
//
//int LCA(int u, int v) {
//	return vs[depth.quary(min(id[u], id[v]), max(id[u], id[v]))];
//}

int main() {
	int n, m; put n >> m;
	int bucket[100000];
	set<int> modList[100000];
	fill(bucket, bucket + 100000, 0);
	rep(i, n) {
		int k; put k;
		bucket[k]++;
		modList[k % m].insert(k);
	}
END:
	int pair = 0;
	for (auto i: modList[0])
	{
		pair += bucket[i]/2;
	}
	rep(i, (m-1)/2) {
		int left = 1 + i;
		int right = m - 1 - i;
		int lPair = 0;
		int rPair = 0;
		int l = 0;
		int r = 0;
		for (auto k : modList[left]) {
			lPair += bucket[k]/2;
			l += bucket[k];
		}
		for (auto k : modList[left]) {
			rPair += bucket[k]/2;
			r += bucket[k];
		}
		//l -= lPair * 2;
		//r -= rPair * 2;
		int ss = min(l,r);
		pair += ss;
		l -= ss; r -= ss;
		pair += l / 2; pair += r / 2;
	}
	putans(pair);
	return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User pekoong
Language C++14 (GCC 5.4.1)
Score 0
Code Size 5663 Byte
Status WA
Exec Time 72 ms
Memory 10112 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 700
Status
AC × 1
WA × 1
AC × 2
WA × 30
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 WA 8 ms 5376 KB
01-02.txt WA 65 ms 8320 KB
01-03.txt WA 64 ms 8320 KB
01-04.txt WA 68 ms 8320 KB
01-05.txt WA 64 ms 8320 KB
01-06.txt WA 67 ms 8320 KB
01-07.txt WA 63 ms 8320 KB
01-08.txt WA 59 ms 8320 KB
01-09.txt WA 55 ms 8320 KB
01-10.txt WA 48 ms 8320 KB
01-11.txt WA 48 ms 8320 KB
01-12.txt WA 36 ms 5376 KB
01-13.txt WA 36 ms 5376 KB
01-14.txt WA 71 ms 9984 KB
01-15.txt WA 71 ms 9984 KB
01-16.txt WA 72 ms 10112 KB
01-17.txt WA 66 ms 9984 KB
01-18.txt WA 60 ms 9984 KB
01-19.txt WA 56 ms 9984 KB
01-20.txt AC 49 ms 9984 KB
01-21.txt WA 45 ms 5504 KB
01-22.txt WA 44 ms 5504 KB
01-23.txt WA 43 ms 5504 KB
01-24.txt WA 40 ms 5504 KB
01-25.txt WA 37 ms 5504 KB
01-26.txt WA 37 ms 5504 KB
01-27.txt WA 28 ms 7680 KB
01-28.txt WA 9 ms 5504 KB
01-29.txt WA 8 ms 5376 KB
01-30.txt WA 8 ms 5376 KB
sample-01.txt AC 8 ms 5376 KB
sample-02.txt WA 8 ms 5376 KB