Submission #243784

#TimeUsernameProblemLanguageResultExecution timeMemory
243784aloo123Gondola (IOI14_gondola)C++14
20 / 100
40 ms4600 KiB
#include <algorithm> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <limits> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <ratio> #include <set> #include <sstream> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> #include <climits> #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/trie_policy.hpp> #include <gondola.h> #define ll long long #define ld long double #define mp make_pair #define pb push_back #define in insert #define vll vector<ll> #define endl "\n" #define pll pair<ll,ll> #define f first #define s second // #define int ll #define sz(x) (ll)x.size() #define all(x) (x.begin(),x.end()) using namespace std; using namespace __gnu_pbds; typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> os; const ll INF = 1e18; const ll N =(1e5+5); // TODO : change value as per problem const ll MOD = 1e9+7; int valid(int n, int a[]){ bool done[n+1]; ll spare = n+1; set<ll> se; ll nxt = a[0]; se.in(nxt); nxt++; if(nxt > n) nxt = 1; // ll spare =n; for(int i = 1;i<n;i++){ if(se.find(a[i]) != se.end()) return 0; if(a[i] <= n){ if(a[i] != nxt) return 0; se.in(a[i]); } else{ if(a[i] < spare){ return 0; } spare = a[i]; } nxt++; if(nxt > n) nxt = 1; } return 1; } int replacement(int n, int a[], int replacementSeq[]) { ll r = -1; ll nxt = a[0]; nxt++; if(nxt > 1) nxt = n; ll spare = n+1; for(int i =1;i<n;i++){ if(a[i] <= n){ ; } else{ r++; replacementSeq[r] = nxt; while(spare != a[i]){ r++; replacementSeq[r] = spare; spare++; } spare++; } nxt++; if(nxt > n) nxt = 1; } return r+1; } int countReplacement(int n, int inputSeq[]) {return -3;} // int main(){ // int n; // cin >> n; // int a[n]; // int x[100000]; // for(int i =0;i<n;i++)cin >> a[i]; // cout << replacement(n,a,x) << endl; // }

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:60:10: warning: unused variable 'done' [-Wunused-variable]
     bool done[n+1];
          ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...