CODE FESTIVAL 2016 Final (Parallel)

Submission #1331151

Source codeソースコード

#include<bits/stdc++.h>
using namespace std;
#define ran 111111
int e[ran];
int m;
int chk(int x){
	int res = 0;
	for(int i=x; i<ran; i+=m)
		res += e[i];
//	printf("%d\n",res);
	return res/2;
}
int chk2(int x){
	int A = 0, B = 0, C = 0, D = 0;
	for(int i=x; i<ran; i+=m){
		A += e[i]/2;
		C += e[i];
	}
	for(int i=m-x; i<ran; i+=m){
		B += e[i]/2;
		D += e[i];
	}
	int tmp1 = min(D-B*2,C);
	int tmp2 = min(C-A*2,D);
//	printf("%d %d %d %d\n",A,B,C,D);
	return max(tmp1+B+min((C-tmp1)/2,A), tmp2+A+min((D-tmp2)/2,B));
}
int main(){
	int x,y;
	for(scanf("%d%d",&x,&m); x--;){
		scanf("%d",&y);
		e[y] ++;
	}
	int res = chk(0);
	if(m % 2 == 0)res += chk(m/2);
	for(int i=1; i+i<m; i++)
		res += chk2(i);
	printf("%d\n",res);
	return 0;
}

Submission

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

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(scanf("%d%d",&x,&m); x--;){
^
./Main.cpp:31:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&y);
^

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 1 ms 256 KB
01-02.txt AC 11 ms 640 KB
01-03.txt AC 11 ms 640 KB
01-04.txt AC 11 ms 640 KB
01-05.txt AC 11 ms 640 KB
01-06.txt AC 11 ms 640 KB
01-07.txt AC 11 ms 640 KB
01-08.txt AC 11 ms 640 KB
01-09.txt AC 11 ms 640 KB
01-10.txt AC 11 ms 640 KB
01-11.txt AC 11 ms 640 KB
01-12.txt AC 10 ms 256 KB
01-13.txt AC 10 ms 256 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 640 KB
01-20.txt AC 11 ms 640 KB
01-21.txt AC 14 ms 640 KB
01-22.txt AC 11 ms 640 KB
01-23.txt AC 11 ms 640 KB
01-24.txt AC 11 ms 640 KB
01-25.txt AC 11 ms 640 KB
01-26.txt AC 11 ms 640 KB
01-27.txt AC 6 ms 384 KB
01-28.txt AC 2 ms 640 KB
01-29.txt AC 2 ms 640 KB
01-30.txt AC 2 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB