oj.uz

Submission #913189

# Submission time Handle Problem Language Result Execution time Memory
913189 2024-01-20T06:33:54 Z Faisal_Saqib Jousting tournament (IOI12_tournament) C++17
49 / 100
 1000 ms 1584 KB 
#pragma once
#include <iostream>
#include <vector>
using namespace std;
const int NPA=1e5+1;
int cs[NPA],ce[NPA],a[NPA],mi[NPA],mx[NPA];
int GetBestPosition(int n, int c, int r, int k[], int s[], int e[])
{
	// Lets change the queries from the changed array to the original array
	for(int i=0;i<n;i++)
		a[i]=mi[i]=mx[i]=i;
	int len=n;
	for(int ro=0;ro<c;ro++)
	{
		int ns=a[s[ro]];
		int ne=a[e[ro]];
		for(int l=s[ro];l<=e[ro];l++)
		{
			ns=min(ns,mi[a[l]]);
			ne=max(ne,mx[a[l]]);
		}
		for(int l=s[ro];l<=e[ro];l++)
		{
			mi[a[l]]=min(ns,mi[a[l]]);
			mx[a[l]]=max(ne,mx[a[l]]);
		}
		for(int j=e[ro];j<len;j++)
			a[j+s[ro]-e[ro]]=a[j];
		len=len-e[ro]+s[ro];
		cs[ro]=ns;
		ce[ro]=ne;
	}
	int wins=0;
	int poss=0;
	a[0]=r;
	for(int j=0;j<(n-1);j++)
		a[j+1]=k[j];
	for(int p=0;p<(n-1);p++)
	{
		int win=0;
		if(p>0)
			swap(a[p-1],a[p]);
		int back_mx=-n-1,front_mx=n+1;
		for(int i=0;i<p;i++)
			if(a[i]>a[p])
				back_mx=i;
		for(int i=n-1;i>p;i--)
			if(a[i]>a[p])
				front_mx=i;
		for(int ro=0;ro<c;ro++)
		{
			if(cs[ro]<=p and p<=ce[ro] and back_mx<cs[ro] and ce[ro]<front_mx)
			{
				win++;
			}
		}
		if(win>wins)
		{
			wins=win;
			poss=p;
		}
	}
	return poss;
}

Compilation message

tournament.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 42 ms 580 KB Output is correct
3 Correct 19 ms 344 KB Output is correct
4 Correct 43 ms 348 KB Output is correct
5 Correct 38 ms 344 KB Output is correct
6 Correct 37 ms 344 KB Output is correct
7 Correct 41 ms 600 KB Output is correct
8 Correct 45 ms 580 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 56 ms 604 KB Output is correct

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1051 ms 1584 KB Time limit exceeded
2 Halted 0 ms 0 KB -