CODE FESTIVAL 2016 Final

Submission #5394540

Source codeソースコード

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
	if(c == '-') f = -1;
	c = getchar();
    }
    while(c >= '0' && c <= '9') {
	res = res * 10 +c - '0';
	c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
	out(x / 10);
    }
    putchar('0' + x % 10);
}
int N,M;
int X[MAXN],cnt[MAXN],a[MAXN],p[MAXN];
void Solve() {
    read(N);read(M);
    for(int i = 1 ; i <= N ; ++i) {
	read(X[i]);cnt[X[i]]++;
    }
    int ans = 0;
    for(int i = 1 ; i <= 100000 ; ++i) {
	ans += cnt[i] / 2;
	p[i % M] += cnt[i] / 2;
	a[i % M] += cnt[i] % 2;
    }
    for(int i = 0 ; i < M ; ++i) {
	if(i > M - i) break;
	if(i == M - i || i == 0) ans += a[i] / 2;
	else {
	    int t = min(a[i],a[M - i]);
	    a[i] -= t;a[M - i] -= t;
	    if(a[i]) {
		t += min(p[M - i],a[i] / 2);
	    }
	    else if(a[M - i]) {
		t += min(p[i],a[M - i] / 2);
	    }
	    ans += t;
	}
    }
    out(ans);enter;
}
int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

Submission

Task問題 D - Pair Cards
User nameユーザ名 sigongzi
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 700
Source lengthソースコード長 1508 Byte
File nameファイル名
Exec time実行時間 7 ms
Memory usageメモリ使用量 1792 KB

Test case

Set

Set name Score得点 / Max score Cases
sample - sample-01.txt,sample-02.txt
all 700 / 700 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt AC 2 ms 256 KB
01-02.txt AC 7 ms 1024 KB
01-03.txt AC 7 ms 1024 KB
01-04.txt AC 7 ms 1024 KB
01-05.txt AC 7 ms 1024 KB
01-06.txt AC 7 ms 1024 KB
01-07.txt AC 7 ms 1024 KB
01-08.txt AC 7 ms 1024 KB
01-09.txt AC 7 ms 1024 KB
01-10.txt AC 7 ms 1408 KB
01-11.txt AC 7 ms 1792 KB
01-12.txt AC 6 ms 640 KB
01-13.txt AC 7 ms 1024 KB
01-14.txt AC 7 ms 1024 KB
01-15.txt AC 7 ms 1024 KB
01-16.txt AC 7 ms 1024 KB
01-17.txt AC 7 ms 1024 KB
01-18.txt AC 7 ms 1024 KB
01-19.txt AC 7 ms 1152 KB
01-20.txt AC 7 ms 1792 KB
01-21.txt AC 7 ms 1024 KB
01-22.txt AC 7 ms 1024 KB
01-23.txt AC 7 ms 1024 KB
01-24.txt AC 7 ms 1024 KB
01-25.txt AC 7 ms 1280 KB
01-26.txt AC 7 ms 1792 KB
01-27.txt AC 5 ms 1408 KB
01-28.txt AC 2 ms 1408 KB
01-29.txt AC 2 ms 896 KB
01-30.txt AC 2 ms 1024 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 2 ms 256 KB