oj.uz

Submission #69022

# Submission time Handle Problem Language Result Execution time Memory
69022 2018-08-19T13:40:19 Z 검수컵(#1978, imsifile) Judge Against Wrong Code (FXCUP3_judge) C++
100 / 100
 410 ms 10012 KB 
#include<stdio.h>

int X, D, C;
int ors[1<<20], usr[1<<20], bm;
char st[22], chk[505050];

int main(){
	scanf("%d", &X); bm=(1<<X)-1;
	scanf("%d", &D);
	for(int i=D; i--;){
		scanf("\n%s", st);
		int su=0;
		for(int j=0; j<X; j++) if(st[j]=='o') su|=1<<j;
		ors[su]=su;
	}
	scanf("%d", &C);
	for(int i=C; i--;){
		chk[i+1]='x';
		scanf("\n%s", st);
		int su=0;
		for(int j=0; j<X; j++) if(st[j]=='x') su|=1<<j;
		usr[su]++;
	}
	for(int i=0; i<X; i++){
		for(int j=0; j<=bm; j++){
			if(j&(1<<i)) continue;
			ors[j^(1<<i)] |= ors[j];
			usr[j^(1<<i)] += usr[j];
		}
	}
	for(int j=0; j<=bm; j++) if(ors[j]==j) chk[C-usr[bm^j]]='o';
	puts(chk+1);
	return 0;
}

Compilation message

judge.cpp: In function 'int main()':
judge.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &X); bm=(1<<X)-1;
  ~~~~~^~~~~~~~~~
judge.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &D);
  ~~~~~^~~~~~~~~~
judge.cpp:11:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n%s", st);
   ~~~~~^~~~~~~~~~~~
judge.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &C);
  ~~~~~^~~~~~~~~~
judge.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n%s", st);
   ~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct

Subtask #2
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 71 ms 1560 KB Output is correct
11 Correct 58 ms 1560 KB Output is correct
12 Correct 14 ms 1560 KB Output is correct
13 Correct 3 ms 1560 KB Output is correct
14 Correct 96 ms 1560 KB Output is correct
15 Correct 136 ms 1752 KB Output is correct
16 Correct 261 ms 1812 KB Output is correct
17 Correct 253 ms 1872 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 71 ms 1560 KB Output is correct
11 Correct 58 ms 1560 KB Output is correct
12 Correct 14 ms 1560 KB Output is correct
13 Correct 3 ms 1560 KB Output is correct
14 Correct 96 ms 1560 KB Output is correct
15 Correct 136 ms 1752 KB Output is correct
16 Correct 261 ms 1812 KB Output is correct
17 Correct 253 ms 1872 KB Output is correct
18 Correct 187 ms 3244 KB Output is correct
19 Correct 114 ms 4636 KB Output is correct
20 Correct 264 ms 9760 KB Output is correct
21 Correct 181 ms 9760 KB Output is correct
22 Correct 365 ms 9860 KB Output is correct
23 Correct 410 ms 10012 KB Output is correct