oj.uz

Submission #366952

# Submission time Handle Problem Language Result Execution time Memory
366952 2021-02-15T19:49:36 Z nafis_shifat Cluedo (IOI10_cluedo) C++14
100 / 100
 14 ms 384 KB 
#include "grader.h"
#include "cluedo.h"
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=1e5+5;
const int inf=1e9;
void Solve(){
   int ok1[7];
   for(int i = 1; i <= 6; i++) ok1[i] = 1;
   int ok2[11];
   for(int i = 1; i <= 10; i++) ok2[i] = 1;
   int ok3[7];
   for(int i = 1; i <= 6; i++) ok3[i] = 1;

   	while(1) {
   		int cnt1 = 0,cnt2 = 0,cnt3 = 0;
   		int m,l,w;
   		for(int i = 1; i <= 6; i++) {
   			cnt1 += ok1[i];
   			if(ok1[i]) m = i;
   		}
   		for(int i = 1; i <= 10; i++) {
   			cnt2 += ok2[i];
   			if(ok2[i]) l = i;
   		}
   		for(int i = 1; i <= 6; i++) {
   			cnt3 += ok3[i];
   			if(ok3[i]) w = i;
   		}

   		

   		int x = Theory(m,l,w);
   		if(x == 0) return;

   		if(x == 1) ok1[m] = 0;
   		else if(x == 2) ok2[l] = 0;
   		else ok3[w] = 0;

   	}

}

Compilation message

cluedo.cpp: In function 'void Solve()':
cluedo.cpp:39:29: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]
   39 |      else if(x == 2) ok2[l] = 0;
      |                      ~~~~~~~^~~

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 364 KB Output is correct
2 Correct 7 ms 364 KB Output is correct
3 Correct 9 ms 364 KB Output is correct
4 Correct 9 ms 364 KB Output is correct
5 Correct 11 ms 364 KB Output is correct
6 Correct 8 ms 364 KB Output is correct
7 Correct 9 ms 364 KB Output is correct
8 Correct 10 ms 364 KB Output is correct
9 Correct 9 ms 364 KB Output is correct
10 Correct 11 ms 364 KB Output is correct
11 Correct 9 ms 364 KB Output is correct
12 Correct 10 ms 364 KB Output is correct
13 Correct 10 ms 364 KB Output is correct
14 Correct 11 ms 364 KB Output is correct
15 Correct 10 ms 364 KB Output is correct
16 Correct 9 ms 364 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 9 ms 364 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 384 KB Output is correct
2 Correct 8 ms 364 KB Output is correct
3 Correct 12 ms 384 KB Output is correct
4 Correct 10 ms 364 KB Output is correct
5 Correct 11 ms 364 KB Output is correct
6 Correct 9 ms 364 KB Output is correct
7 Correct 13 ms 364 KB Output is correct
8 Correct 6 ms 364 KB Output is correct
9 Correct 13 ms 364 KB Output is correct
10 Correct 14 ms 384 KB Output is correct
11 Correct 12 ms 364 KB Output is correct
12 Correct 12 ms 364 KB Output is correct
13 Correct 10 ms 364 KB Output is correct
14 Correct 7 ms 364 KB Output is correct
15 Correct 13 ms 364 KB Output is correct
16 Correct 12 ms 256 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 13 ms 364 KB Output is correct