oj.uz

Submission #912903

# Submission time Handle Problem Language Result Execution time Memory
912903 2024-01-20T04:22:59 Z Muhammad_Aneeq Jousting tournament (IOI12_tournament) C++17
0 / 100
 13 ms 3316 KB 
#include <vector>
using namespace std;
int GetBestPosition(int N, int C, int R, int K[], int S[], int E[])
{
	vector<int>co[N]={};
	for (int i=0;i<C;i++)
	{
		co[S[i]].push_back(E[i]);
		co[E[i]].push_back(S[i]);
	}
	int ans=0,pos=0;
	for (int i=0;i<N;i++)
	{
		int z=0;
		for (auto j:co[i])
		{
			if (R>K[j-(j>i)])
				z++;
			else
				break;
		}
		if (z>ans)
		{
			ans=z;
			pos=i;
		}
	}
	return pos;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 3316 KB Output isn't correct
2 Halted 0 ms 0 KB -