Submission #380989

#	Time	Username	Problem	Language	Result	Execution time	Memory
380989		Karliver	Cluedo (IOI10_cluedo)	C++14	50 / 100	212 ms	364 KiB

cluedo

#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 / 50
• Subtask 2: 0 / 50