# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
932733 | 2024-02-24T05:41:05 Z | vjudge1 | Gondola (IOI14_gondola) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> #pragma GCC optimize("Ofast") using namespace std; #define F first #define S second #define ll long long // #define int ll #define pb push_back #define sz(s) (int)s.size() #define pii pair<int,int> #define all(v) v.begin(),v.end() #define mem(a,i) memset(a,i,sizeof(a)) #define in insert #define lb lower_bound #define ub upper_bound #define y1 yy #define ppb pop_back #define ull unsigned ll const int MAX=2e6+55; const int inf=1e9; const int N=2e5; const int C=331; const int C1=431; const int mod=1e9+7; const int mod1=1e9+9; #include "gondola.h" int valid(int n, int a[]) { int mn=0; for(int i=0;i<n;i++){ if(a[i]<a[mn])mn=i; } vector<int> v; for(int i=mn;i<n;i++)if(a[i]<=n)v.pb(a[i]); for(int i=0;i<mn;i++)if(a[i]<=n)v.pb(a[i]); for(int i=1;i<sz(v);i++){ if(v[i]<=v[i-1])return 0; } return 1; }