# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
912998 | Muhammad_Aneeq | Jousting tournament (IOI12_tournament) | C++17 | 1029 ms | 3172 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 <iostream>
#include <vector>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int GetBestPosition(int N, int C, int R, int K[], int S[], int E[])
{
int ans=0,pos=0;
ordered_set s;
for (int i=0;i<N;i++)
{
s={};
for (int j=0;j<N;j++)
s.insert(j);
int z=0;
for (int j=0;j<C;j++)
{
int ma=0;
bool w=0;
for (int k=S[j];k<=E[j];k++)
{
int z=*s.find_by_order(k);
int f=0;
if (z==i)
{
w=1;
f=R;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |