# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287654 | Saboon | Scales (IOI15_scales) | C++17 | 20 ms | 5632 KiB |
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 "scales.h"
#include <bits/stdc++.h>
using namespace std;
int P[720][6], p[6], dp[720 + 10];
vector<int> per[100*720 + 100], t[100*720 + 100];
int newint = 2;
vector<int> Q[100*720+100];
int getMax(int x, int i, int j, int k){
for (int idx = 5; idx >= 0; idx--)
if (P[x][idx] == i or P[x][idx] == j or P[x][idx] == k)
return P[x][idx];
}
int getMin(int x, int i, int j, int k){
for (int idx = 0; idx <= 5; idx++)
if (P[x][idx] == i or P[x][idx] == j or P[x][idx] == k)
return P[x][idx];
}
int getMid(int x, int i, int j, int k){
bool found = 0;
for (int idx = 5; idx >= 0; idx--){
if (P[x][idx] == i or P[x][idx] == j or P[x][idx] == k){
if (found)
return P[x][idx];
else
found = 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |