# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858042 | samek08 | Prisoner Challenge (IOI22_prison) | C++17 | 11 ms | 1628 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<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a,b) for (int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()
struct Przedzial
{
int l,p, idx;
};
const int MAXM = 22;
vector<vector<int>> wyn;
vector<bool> doit;
inline Przedzial zejdz(int l, int p, int idx)
{
if(l == p)
{
return{l,p,1};
}
if (l+1 == p)
{
if(idx == l) return {l,l,1};
return {p,p,2};
}
int s = (p-l+1) / 3;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |