Submission #1063656

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063656		Edu175	Gondola (IOI14_gondola)	C++17	10 / 100	7 ms	1884 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ioi=b;i<ioi;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto fdgkj:v)cout<<fdgkj<<" ";cout<<"\n";}
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;

void rotate(vector<ll>&a, ll x){
	rotate(a.begin(),a.begin()+x,a.end());
}

int valid(int n, int A[]){
	vector<ll>a(n);
	fore(i,0,n)a[i]=A[i]-1;
	ll done=0;
	// imp(a);
	fore(i,0,n)if(!done&&a[i]<n){
		// cout<<i<<": "<<a[i]<<"\n";
		rotate(a,(n-a[i])%n),done=1;
	}
	if(!done)return 1;
	// imp(a);
	ll flag=1;
	fore(i,0,n){
		ll fi=a[i]>=n||a[i]==i;
		flag&=fi;
		// if(!fi)cout<<i<<" "<<a[i]<<"\n";
	}
	return flag;
}
int replacement(int n, int A[], int res[]){
	return 0;
	/*vector<ll>a(n);
	fore(i,0,n)a[i]=A[i]-1;
	ll done=0;
	fore(i,0,n)if(!done&&a[i]<n){
		rotate(a,(n-a[i])%n),done=1;
	}
	if(!done)return 1;
	ll flag=1;
	fore(i,0,n){
		ll fi=a[i]>=n||a[i]==i;
		flag&=fi;
		// if(!fi)cout<<i<<" "<<a[i]<<"\n";
	}
	return flag;*/
}
int countReplacement(int n, int inputSeq[]){
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10