# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078800 | LittleOrange | Prisoner Challenge (IOI22_prison) | C++17 | 12 ms | 1372 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 "prison.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = int;
const ll m = 6;
ll g(ll x, ll lv){
//cerr << "g " << x << " " << lv;
while(lv-->0) x/=m;
//cerr << " = " << x%m << "\n";
return x%m;
}
ll cal(ll x){
ll r = -1;
while(x){
r++;
x/=m;
}
return r;
}
std::vector<std::vector<int>> devise_strategy(int N) {
ll n = N;
ll lvl = cal(n);
vector<vector<ll>> ret;
vector<ll> mp;
{
vector<ll> a(n+1,0);
for(ll i = 1;i<=n;i++) a[i] = g(i,lvl)+1;
ret.push_back(a);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |