oj.uz

Submission #380993

# Submission time Handle Problem Language Result Execution time Memory
380993 2021-03-24T07:02:43 Z Karliver Cluedo (IOI10_cluedo) C++14
0 / 100
 1 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(){
	int a = 1, b =1, c =1;
   	int r = Theory(a, b, c);
    while(!r) {
    	if(r == 1)++a;
        else if(r == 2)++b;
        else ++c;
       	r = Theory(a, b,c);
       }
     	
}

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Incorrect
2 Halted 0 ms 0 KB -