| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 238093 |
2020-06-09T22:38:03 Z |
Fasho |
Gondola (IOI14_gondola) |
C++14 |
|
0 ms |
0 KB |
#include "gondola.h"
#include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("badhair.gir","r",stdin);freopen ("badhair.cik","w",stdout);
#define mod 1000000007
#define fs(x,y) for(ll i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define INF 1000000000005
#define ull unsigned long long int
ll ar[N];
int valid(int n, int inputSeq[])
{
ll x=-1;
fo(i,1,n)
ar[i]=inputSeq[i-1];
sort(ar+1,ar+n+1);
fo(i,2,n)
if(ar[i-1]==ar[i])
return 0;
fo(i,1,n)
ar[i]=inputSeq[i-1];
fo(i,i,n)
if(ar[i]<=n)
{
x=i;
break;
}
if(x==-1)
return 1;
int flag=0;
fo(i,x+1,n)
{
if(ar[i]<=n)
{
if((i-x+ar[x])%n!=ar[i])
return 0;
}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
Compilation message
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:29:2: error: 'sort' was not declared in this scope
sort(ar+1,ar+n+1);
^~~~
gondola.cpp:29:2: note: suggested alternative:
In file included from /usr/include/c++/7/algorithm:62:0,
from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:65,
from gondola.cpp:2:
/usr/include/c++/7/bits/stl_algo.h:4856:5: note: 'std::sort'
sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
^~~~
gondola.cpp:46:6: warning: unused variable 'flag' [-Wunused-variable]
int flag=0;
^~~~
