| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 599218 | MohamedAliSaidane | Jousting tournament (IOI12_tournament) | C++14 | 0 ms | 0 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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef long double ld;
///#define int ll
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
#define pb push_back
#define popb pop_back
#define pp pop_back
#define pf push_front
#define popf pop_front
#define all(x) (x).begin(),(x).end()
#define ff first
#define ss second
int nx[4] = {0,0,1,-1}, ny[4] = {1,-1,0,0};
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);}
const ll MOD = 998244353;
int n, c, r;
vi k, s, e;
int GetBestPosition(int N, int C, int R, vi K, vi S, vi E)
{
n = N, c= C, r = R, k = K, s = S, e = E;
int curmax =0, curpos = 0;
for(int pos =0; pos < n; pos ++)
{
indexed_set rem;
vi pow(n);
for(int i= 0; i < n; i++)
{
rem.insert(i);
pow[i] = (i < pos)? k[i]: i == pos? r: k[i - 1];
}
for(int round = 0; round < c; round ++)
{
int mini = n;
for(int j = s[round]; j <= e[round]; j ++)
{
int u= *(rem.find_by_order(j));
mini = min(mini, pow[u]);
}
vi remv;
bool flag= true;
for(int j = s[round]; j <= e[round]; j ++)
{
int u= *(rem.find_by_order(j));
if(pow[u] > mini)
{
if(u == pos)
{
flag = false;
if(round > curmax)
{
curmax = round;
curpos = pos;
}
break;
}
remv.pb(u);
}
for(auto e: remv)
rem.erase(e);
}
if(!flag)
break;
}
}
return curpos;
}
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int tt = 1; //'cin >> tt;
}