# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167980 | HappyCapybara | Scales (IOI15_scales) | C++17 | 11 ms | 444 KiB |
#include "scales.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> v = {0, 1, 2, 3, 4, 5};
vector<vector<int>> qs;
unordered_set<int> us;
int query(int t, int a, int b, int c, int d=-1){
if (t == 0){
if (v[a] > v[b] && v[a] > v[c]) return a;
else if (v[b] > v[a] && v[b] > v[c]) return b;
else return c;
}
if (t == 1){
if (v[a] < v[b] && v[a] < v[c]) return a;
else if (v[b] < v[a] && v[b] < v[c]) return b;
else return c;
}
if (t == 2){
if (v[a] > min(v[b], v[c]) && v[a] < max(v[b], v[c])) return a;
else if (v[b] > min(v[a], v[c]) && v[b] < max(v[a], v[c])) return b;
else return c;
}
if (t == 3){
if (v[a] > v[d] && (v[b] > v[a] || v[b] < v[d]) && (v[c] > v[a] || v[c] < v[d])) return a;
else if (v[b] > v[d] && (v[a] > v[b] || v[a] < v[d]) && (v[c] > v[b] || v[c] < v[d])) return b;
else if (v[c] > v[d] && (v[a] > v[c] || v[a] < v[d]) && (v[b] > v[c] || v[b] < v[d])) return c;
else return query(1, a, b, c);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |