Submission #67674

#	Time	Username	Problem	Language	Result	Execution time	Memory
67674		tempytemptemp	Permutation Recovery (info1cup17_permutation)	C++14	10 / 100	172 ms	496 KiB

Main

/*
  We found Despacito 5 during contest (not clickbait)
*/
#include	<iostream>
#include	<cstdio>
#include	<vector>
#include 	<set>
#include	<map>
#include	<queue>
#include	<stack>
#include	<algorithm>
#include	<cstring>
#include	<cfloat>
#include	<cmath>
#include	<cassert>
#include	<locale>
#include	<string>
#include	<bitset>
#include	<functional>
#include	<climits>
#include	<iomanip>
using namespace std;

#define read(x)     freopen(x,"r",stdin)
#define write(x)    freopen(x,"w",stdout)
#define cl(a,b)	    memset(a,b,sizeof(a))
#define all(x)      x.begin(),x.end()
#define rall(x)     x.rbegin(),x.rend()
#define ll          long long
#define ld          long double
#define vec         vector
#define vi          vec<int>
#define heap        priority_queue
#define res         reserve
#define pb          push_back
#define f(x,y,z)    for(int x=(y); x<(z); x++)
#define fd(x,y,z)   for(int x=(y); x>=(z); x--)
#define fit(x,y)    for(auto x: y)
#define srt(x)      sort(all(x))
#define rsrt(x)     sort(rall(x))
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define pii         pair<int,ll>
#define ppi         pair<pii,int>
#define pip         pair<int,pii>
#define mp          make_pair
#define f1          first
#define s2          second
#define cdbg(x)     cerr<<#x<<" = "<<x<<",\t";
#define cdbl        cerr<<"\n----------\n";
#define pow2(x)     ((x)*(x))
#define edist(x1, y1, x2, y2) (sqrt((pow2(x1-x2)+pow2(y1-y2))))
#define mdist(x1, y1, x2, y2) (abs((x1)-(x2))+abs((y1)-(y2)))
#define y1          FullSensei
#define mid         ((ss+se)>>1)
#define left        (si<<1)
#define right       ((si<<1)+1)
#define pi          3.141592653589793
#define popcount    __builtin_popcount
#define spc			' '
#define endl		'\n'
#define lb          lower_bound
bool checkbit(int x,int y){return (x&(1<<y));}
int setbit(int x,int y){return (x^(1<<y));}
const int dirs[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int mod=1e9+7;
const int p1=805306457;
const int p2=1610612741;
const int INF=1e9;
const int N=9;
vi v, p;
int n;
int d[N+3];

bool vis[(1<<(N+1))];

void fun(int mask, int starti, int lastval){
	if(starti>=n)
		return;
	if(vis[mask])
		return;
	vis[mask]=1;
	f(i,starti,n){
		if(p[i] > lastval){
			d[i]++;
			fun(setbit(mask,i), i+1, p[i]);
		}
	}
}

bool test(){
	cl(d,0);
	cl(vis,0);
	fun(0,0,0);
	f(i,1,n){
		if(d[i] != v[i] - v[i-1])
			return false;
	}
	return true;
}

int main(){
	scanf("%d",&n);
	assert(n<=N);
	f(i,0,n){
		int temp;
		cin>>temp;
		v.pb(temp);
	}
	f(i,0,n)
		p.pb(i+1);
	do{
		if(test())
			break;
	}
	while(next_permutation(all(p)));
	f(i,0,n)
		cout<<p[i]<<spc;
	cout<<endl;
	return 0;
}

Compilation message (stderr)

permutation.cpp: In function 'int main()':
permutation.cpp:102:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 7
• Subtask 7: 0 / 16
• Subtask 8: 0 / 6