oj.uz

Submission #408573

# Submission time Handle Problem Language Result Execution time Memory
408573 2021-05-19T08:24:16 Z Jasiekstrz Archery (IOI09_archery) C++17
75 / 100
 2000 ms 5384 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=2e5;
int tab[2*N+10];
int stationary(int n)
{
	int ans=n+1,g=n;
	for(int i=1;i<=n;i++)
	{
		vector<int> st;
		int cnt=0;
		for(int j=i+1;j<=n;j++)
		{
			if(tab[2*j-1]==-1 && tab[2*j-2]==-1)
				st.push_back(j);
			else if(tab[2*j-1]==1 && tab[2*j-2]==1)
			{
				if(st.empty())
					cnt++;
				else
					st.pop_back();
			}
		}
		if(i!=1)
		{
			if(tab[1]==1)
			{
				if(st.empty())
					cnt++;
				else
					st.pop_back();
			}
			if(tab[2]==1)
			{
				if(st.empty())
					cnt++;
				else
					st.pop_back();
			}
		}
		for(int j=2;j<i;j++)
		{
			if(tab[2*j-1]==-1 && tab[2*j]==-1)
				st.push_back(j);
			else if(tab[2*j-1]==1 && tab[2*j]==1)
			{
				if(st.empty())
					cnt++;
				else
					st.pop_back();
			}
		}
		if(i==1)
			cnt++;
		if(tab[2*i-1]==1)
			cnt++;
		st.push_back(i);
		int w=st[st.size()-1-cnt];
		if(w<ans || (w==ans && i>g))
		{
			ans=w;
			g=i;
		}
	}
	return g;
}
int moving(int n,int r)
{
	int ans=n+1,g=n;
	int fl;
	bool one=false;
	for(int i=1;i<2*n;i++)
	{
		if(tab[i]==1)
			continue;
		fl=i;
		break;
	}
	for(int i=1;i<=n;i++)
	{
		vector<int> st;
		int cnt=0;
		one=true;
		if(tab[2*i-1]==-1)
		{
			if(fl==2*i-1)
			{
				one=false;
				if(i!=1)
					st.push_back(i);
			}
			if(i!=1)
				cnt++;
		}
		for(int j=i-1;j>1;j--)
		{
			if(tab[2*j-1]==1 && tab[2*j]==1)
				st.push_back(j);
			else if(tab[2*j-1]==-1 && tab[2*j]==-1)
			{
				if(st.empty())
					cnt++;
				else
					st.pop_back();
			}
			if(j==(fl+1)/2)
			{
				one=false;
				st.push_back(j);
			}
		}
		if(i!=1)
		{
			if((fl+1)/2==1)
				one=false;
			else if(tab[1]==-1 && tab[2]==-1)
			{
				if(st.empty())
					cnt++;
				else
					st.pop_back();
			}
			if(tab[1]==1 || tab[2]==1)
				st.push_back(1);
		}
		for(int j=n;j>i;j--)
		{
			if(tab[2*j-1]==1 && tab[2*j-2]==1)
				st.push_back(j);
			else if(tab[2*j-1]==-1 && tab[2*j-2]==-1)
			{
				if(st.empty())
					cnt++;
				else
					st.pop_back();
			}
		}
		st.push_back(i);
		int w;
		//cerr<<i<<" "<<w<<" "<<cnt<<"\n";
		//for(auto v:st)
		//	cerr<<v<<" ";
		//cerr<<"\n\n";
		if(one)
			w=(fl+2)/2;
		else
			w=st[st.size()-1-cnt];
		w=((i-(r-(w-i))-1)%n+n)%n+1;
		//cerr<<i<<" "<<w<<" "<<cnt<<"\n";
		//for(auto v:st)
		//	cerr<<v<<" ";
		//cerr<<"\n\n";
		if(w<ans || (w==ans && i>g))
		{
			ans=w;
			g=i;
		}
	}
	return g;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n,r,x;
	cin>>n>>r>>x;
	for(int i=1;i<2*n;i++)
	{
		cin>>tab[i];
		if(tab[i]>x)
			tab[i]=1;
		else
			tab[i]=-1;
	}
	if(x==1)
		cout<<n<<"\n";
	else if(2<=x && x<=n+1)
		cout<<moving(n,r)<<"\n";
	else
		cout<<stationary(n)<<"\n";
	return 0;
}

Compilation message

archery.cpp: In function 'int moving(int, int)':
archery.cpp:72:6: warning: 'fl' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |  int fl;
      |      ^~

Subtask #1
5.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 1 ms 224 KB Output isn't correct
4 Correct 25 ms 352 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #2
70.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 9 ms 332 KB Output is correct
4 Correct 1830 ms 612 KB Output is correct
5 Execution timed out 2078 ms 3912 KB Time limit exceeded
6 Incorrect 2 ms 204 KB Output isn't correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 913 ms 716 KB Output is correct
9 Correct 1803 ms 760 KB Output is correct
10 Correct 7 ms 328 KB Output is correct
11 Execution timed out 2087 ms 716 KB Time limit exceeded
12 Correct 34 ms 372 KB Output is correct
13 Execution timed out 2086 ms 3264 KB Time limit exceeded
14 Correct 119 ms 412 KB Output is correct
15 Execution timed out 2097 ms 936 KB Time limit exceeded
16 Correct 1 ms 204 KB Output is correct
17 Correct 9 ms 332 KB Output is correct
18 Correct 18 ms 340 KB Output is correct
19 Correct 49 ms 368 KB Output is correct
20 Correct 100 ms 420 KB Output is correct
21 Correct 1692 ms 840 KB Output is correct
22 Execution timed out 2065 ms 916 KB Time limit exceeded
23 Execution timed out 2065 ms 4628 KB Time limit exceeded
24 Correct 1 ms 204 KB Output is correct
25 Correct 5 ms 332 KB Output is correct
26 Correct 115 ms 420 KB Output is correct
27 Execution timed out 2089 ms 716 KB Time limit exceeded
28 Execution timed out 2082 ms 3344 KB Time limit exceeded
29 Correct 9 ms 356 KB Output is correct
30 Correct 113 ms 488 KB Output is correct
31 Correct 1441 ms 708 KB Output is correct
32 Execution timed out 2085 ms 4436 KB Time limit exceeded
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 20 ms 376 KB Output is correct
36 Correct 25 ms 368 KB Output is correct
37 Correct 997 ms 640 KB Output is correct
38 Execution timed out 2082 ms 716 KB Time limit exceeded
39 Correct 2 ms 204 KB Output is correct
40 Correct 6 ms 332 KB Output is correct
41 Correct 21 ms 364 KB Output is correct
42 Correct 28 ms 332 KB Output is correct
43 Correct 92 ms 524 KB Output is correct
44 Correct 345 ms 516 KB Output is correct
45 Correct 1407 ms 872 KB Output is correct
46 Correct 1935 ms 724 KB Output is correct
47 Execution timed out 2079 ms 5384 KB Time limit exceeded