This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include<unordered_map>
#include"grader.h"
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto&a:v)
#define sz(a) a.size()
typedef long double ld;
using namespace std;
static const long long inf = 1e15;
typedef long long ll;
typedef unsigned long long ull;
void Solve(){
vector<ll> m;
vector<ll> l;
vector<ll> w;
rep(i, 1, 7) {
m.push_back(i);
w.push_back(i);
}
rep(i, 1, 10)l.push_back(i);
while (1) {
ll a, b, c;
a = rand() % m.size();
b = rand() % l.size();
c = rand() % w.size();
ll cur=Theory(m[a], l[b], w[c]);
if (cur == 0)break;
else if (cur == 1) m.erase(m.begin() + a);
else if (cur == 2)l.erase(l.begin() + b);
else w.erase(w.begin() + c);
}
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |