oj.uz

Submission #118868

# Submission time Handle Problem Language Result Execution time Memory
118868 2019-06-20T00:12:26 Z ly20 Gondola (IOI14_gondola) C++17
60 / 100
 52 ms 5240 KB 
#include<bits/stdc++.h>
using namespace std;
const int INF=1123456789,MAXN=250010,MOD=1e9+7,MAXL=32;
#define debug(args...) //fprintf(stderr,args)
map<int,int> vld;
int marc[MAXN];
#include "gondola.h"
int valid(int n,int seq[])
{
	int mn=INF,at=INF,at2=INF,id0=0;
	int st=0;
	bool vl=1;
	for(int i=0;i<n;i++)
	{
		if(vl==0)debug("%d\n",i);
		if(vld[seq[i]]>0)vl=0;
		vld[seq[i]]++;
		if(st==0)
		{
			if(seq[i]>n)continue;
			if(seq[i]<at && at==INF)
			{
				at=seq[i];mn=seq[i];
				id0=(i+1-mn+n)%n;
			}
			else if(seq[i]<at)
			{
				at2=seq[i];st=1;
				if(at2>mn)vl=0;
			}
			else
			{
				if((id0+seq[i]-1)%n!=i)vl=0;
				at=seq[i];
			}
		}
		else
		{
			if(seq[i]>n)continue;
			if(seq[i]<at2 || seq[i]>mn || seq[i]>at)vl=0;
			if((id0+seq[i]-1)%n!=i)vl=0;
			at2=seq[i];
		}
		debug("%d %d %d\n",i,id0,(id0+seq[i])%n);
	}	
	return vl;
}
int replacement(int n,int seq[],int replacementseq[])
{
	vector<pair<int,int> > v;
	int mn=INF,at=INF,at2=INF,id0=0,mx=0,imx=0;
	int st=0;
	bool vl=1;
	for(int i=0;i<n;i++)
	{
		marc[seq[i]]=1;
		if(mx<seq[i])imx=i;
		mx=max(mx,seq[i]);
		if(vl==0)debug("%d\n",i);
		if(vld[seq[i]]>0)vl=0;
		vld[seq[i]]++;
		if(st==0)
		{
			if(seq[i]>n)continue;
			if(seq[i]<at && at==INF)
			{
				at=seq[i];mn=seq[i];
				id0=(i+1-mn+n)%n;
			}
			else if(seq[i]<at)
			{
				at2=seq[i];st=1;
				if(at2>mn)vl=0;
			}
			else
			{
				if((id0+seq[i]-1)%n!=i)vl=0;
				at=seq[i];
			}
		}
		else
		{
			if(seq[i]>n)continue;
			if(seq[i]<at2 || seq[i]>mn || seq[i]>at)vl=0;
			if((id0+seq[i]-1)%n!=i)vl=0;
			at2=seq[i];
		}
		debug("%d %d %d\n",i,id0,(id0+seq[i])%n);
	}
	int cnt=0,lst=(imx-id0+n)%n+1;
	for(int i=0;i<n;i++)if(seq[i]>n && seq[i]!=mx)replacementseq[seq[i]-n-1]=(i-id0+n)%n+1;
	for(int i=n+1;i<mx;i++)
	{
		if(!marc[i] && cnt==0)
		{
			replacementseq[i-n-1]=(imx-id0+n)%n+1;
			cnt=1;
			lst=i;
		}
		else if(!marc[i])
		{
			replacementseq[i-n-1]=lst;
			lst=i;
		}
	}
	for(int i=0;i<n;i++)if(seq[i]==mx)replacementseq[mx-n-1]=lst;
	//for(int i=0;i<mx-n;i++)printf("%d ",replacementseq[i]);
	//printf("\n");
	return mx-n;
}
long long fst_exp(long long n,int k)
{
	long long val=n;
	long long resp=1;
	for(int i=MAXL-1;i>=0;i--)
	{
		resp*=resp;
		if(k&(1<<i))resp*=val;
		if(resp>MOD)resp=resp%MOD;
	}
	return resp;
}
int countReplacement(int n,int seq[])
{
	vector<int> v;
	int mn=INF,at=INF,at2=INF,id0=0,mx=0,imx=0;
	int st=0;
	bool vl=1;
	for(int i=0;i<n;i++)
	{
		if(seq[i]>n)v.push_back(seq[i]);
		if(mx<seq[i])imx=i;
		mx=max(mx,seq[i]);
		if(vl==0)debug("%d\n",i);
		if(vld[seq[i]]>0)vl=0;
		vld[seq[i]]++;
		if(st==0)
		{
			if(seq[i]>n)continue;
			if(seq[i]<at && at==INF)
			{
				at=seq[i];mn=seq[i];
				id0=(i+1-mn+n)%n;
			}
			else if(seq[i]<at)
			{
				at2=seq[i];st=1;
				if(at2>mn)vl=0;
			}
			else
			{
				if((id0+seq[i]-1)%n!=i)vl=0;
				at=seq[i];
			}
		}
		else
		{
			if(seq[i]>n)continue;
			if(seq[i]<at2 || seq[i]>mn || seq[i]>at)vl=0;
			if((id0+seq[i]-1)%n!=i)vl=0;
			at2=seq[i];
		}
		debug("%d %d %d\n",i,id0,(id0+seq[i])%n);
	}
	if(vl==0)return vl;
	sort(v.begin(),v.end());
	long long resp=1;
	int cnt=0,lst=n;
	for(int i=0;i<v.size();i++)
	{
		resp*=fst_exp(v.size()-i,v[i]-lst-1);
		//printf("%lld %d %d %d %d\n",resp,v.size()-i,v[i]-lst-1,v[i],lst);
		if(resp>MOD)resp%=MOD;
		lst=v[i];
	}
	if(v.size()==n)resp*=n;
	resp%=MOD;
	//for(int i=0;i<mx-n;i++)printf("%d ",replacementseq[i]);
	//printf("\n");
	return resp;
}
/*int main()
{
	int n;
	int v[40],k[40];
	scanf("%d",&n);
	for(int i=0;i<n;i++)scanf("%d",&v[i]);
	printf("%d\n",countReplacement(n,v));
	return 0;
}*/

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:169:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v.size();i++)
              ~^~~~~~~~~
gondola.cpp:176:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(v.size()==n)resp*=n;
     ~~~~~~~~^~~
gondola.cpp:126:39: warning: variable 'imx' set but not used [-Wunused-but-set-variable]
  int mn=INF,at=INF,at2=INF,id0=0,mx=0,imx=0;
                                       ^~~
gondola.cpp:168:6: warning: unused variable 'cnt' [-Wunused-variable]
  int cnt=0,lst=n;
      ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 16 ms 2280 KB Output is correct
7 Correct 41 ms 3704 KB Output is correct
8 Correct 31 ms 3960 KB Output is correct
9 Correct 9 ms 1536 KB Output is correct
10 Correct 38 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 16 ms 2176 KB Output is correct
7 Correct 41 ms 3680 KB Output is correct
8 Correct 28 ms 3968 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 40 ms 4600 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 20 ms 2176 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 52 ms 4728 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 34 ms 4728 KB Output is correct
12 Correct 38 ms 5240 KB Output is correct
13 Correct 26 ms 3192 KB Output is correct
14 Correct 39 ms 4600 KB Output is correct
15 Correct 24 ms 3448 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -