# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200000 | Mercenary | Scales (IOI15_scales) | C++14 | 75 ms | 640 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<bits/stdc++.h>
using namespace std;
#include"scales.h"
#define mp make_pair
#define pb push_back
const int maxn = 2e6;
vector<vector<int>> perm;
vector<int> lim ={243,81,27,9,3,1};
vector<int> p;
int a[maxn] , b[maxn][3];
int root , nTime = 0;
vector<pair<int,vector<int>>> query;
vector<vector<int>> GetLig(vector<int> & p , vector<int> &a){
vector<vector<int>> res(3);
vector<int> tmp(3);iota(tmp.begin(),tmp.end(),0);
for(auto & c : p){
sort(tmp.begin(),tmp.end(),[&](const int x , const int y){
return perm[c][a[x]] < perm[c][a[y]];
});
res[tmp[0]].pb(c);
}
return res;
}
vector<vector<int>> GetHea(vector<int> & p , vector<int> &a){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |