oj.uz

Submission #380989

# Submission time Handle Problem Language Result Execution time Memory
380989 2021-03-24T06:48:58 Z Karliver Cluedo (IOI10_cluedo) C++14
50 / 100
 212 ms 364 KB 
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
#include <fstream>
#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;
typedef complex<ll> G;
const int INF = 1e9 + 1;
const int N = 1e6;
const double eps = 1e-3;

template <typename XPAX>
void ckma(XPAX &x, XPAX y) {
    x = (x < y ? y : x);
}
template <typename XPAX>
void ckmi(XPAX &x, XPAX y) {
    x = (x > y ? y : x);
}

void Solve(){
   	vector<int> comb1, comb2, comb3;
   	for(int i = 1;i <= 6;++i) {
    	for(int j = 1;j <= 10;++j) {
       		for(int k = 1;k <= 6;++k) {
            	comb1.push_back(i);
                comb2.push_back(j);
                comb3.push_back(k);
                
            }
        }
    }
   	forn(i, 360) {
    	int r = Theory(comb1[i], comb2[i], comb3[i]);
       	if(!r)return;
    }
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 364 KB Output is correct
2 Correct 131 ms 364 KB Output is correct
3 Correct 195 ms 364 KB Output is correct
4 Correct 114 ms 364 KB Output is correct
5 Correct 166 ms 364 KB Output is correct
6 Correct 194 ms 364 KB Output is correct
7 Correct 178 ms 364 KB Output is correct
8 Correct 150 ms 364 KB Output is correct
9 Correct 147 ms 364 KB Output is correct
10 Correct 194 ms 364 KB Output is correct
11 Correct 163 ms 364 KB Output is correct
12 Correct 155 ms 364 KB Output is correct
13 Correct 130 ms 364 KB Output is correct
14 Correct 200 ms 364 KB Output is correct
15 Correct 188 ms 364 KB Output is correct
16 Correct 203 ms 364 KB Output is correct
17 Correct 146 ms 364 KB Output is correct
18 Correct 209 ms 364 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 144 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -