Submission #200565

#TimeUsernameProblemLanguageResultExecution timeMemory
200565mohammadGondola (IOI14_gondola)C++14
5 / 100
6 ms380 KiB
/* ░░░░██████████████████ ░░▄███████▀▀▀▀▀▀███████▄ ░▐████▀▒mohammad▒▀██████▄ ░███▀▒▒▒▒alaa▒▒▒▒▒▒▀█████ ░▐██▒▒▒alwrawrah▒▒▒▒▒████▌ ░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌ ░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌ ░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌ ░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌ ░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌ ░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█ ░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀ ░░░░▄██████████████▒▒▐▌ ░░░▀███▀▀████▀█████▀▒▌ ░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐ ░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐ */ #include<bits/stdc++.h> #include "gondola.h" using namespace std; typedef long long ll ; const ll oo = 4294967296 ; const double PI = acos(-1) ; const ll M = 998244353 ; map<int,int> mp; vector<pair<int,int>> v; int valid(int n, int inputSeq[]){ // bool b = false ; // for(int i = 0 ; i < n ; ++i){ // mp[inputSeq[i]]++; // if(mp[inputSeq[i]] > 1)return 0; // if(inputSeq[i] <= n){ // b = 1 ; // int x = inputSeq[i]; // int f = i - 1; // while(f > -1 && inputSeq[f] > n){ // x--; // if(x == 0) x = n; // inputSeq[f] = x; // mp[x]++; // if(mp[x] > 1) return 0 ; // f--; // } // f = i + 1 ; // x = inputSeq[i]; // while(f < n && inputSeq[f] > n){ // x++; // if(x == n + 1) x = 1; // inputSeq[f] = x; // mp[x]++; // if(mp[x] > 1)return 0; // f++; // } // } // } // if(b){ // for(int i = 1 ; i < n ; ++i) // if((inputSeq[i] == 1 && inputSeq[i - 1] != n) || (inputSeq[i] != 1 && inputSeq[i - 1] + 1 != inputSeq[i])) return 0; // } return -1 ; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]){ bool b = false ; for(int i = 0 ; i < n ; ++i){ mp[gondolaSeq[i]]++; if(mp[gondolaSeq[i]] > 1)return 0; if(gondolaSeq[i] <= n){ b = 1; int x = gondolaSeq[i]; int f = i - 1; while(f > -1 && gondolaSeq[f] > n){ x--; if(x == 0) x = n; v.push_back({gondolaSeq[f] , x}); gondolaSeq[f] = x; mp[x]++; if(mp[x] > 1) return 0 ; f--; } f = i + 1 ; x = gondolaSeq[i]; while(f < n && gondolaSeq[f] > n){ x++; if(x == n + 1) x = 1; v.push_back({gondolaSeq[f] , x}); gondolaSeq[f] = x; mp[x]++; if(mp[x] > 1)return 0; f++; } i = f - 1; } } int l = 0 , ls = n + 1; if(b){ for(int i = 1 ; i < n ; ++i) if((gondolaSeq[i] == 1 && gondolaSeq[i - 1] != n) || (gondolaSeq[i] != 1 && gondolaSeq[i - 1] + 1 != gondolaSeq[i])) return 0; sort(v.begin(), v.end()); for(auto x : v){ replacementSeq[l++] = x.second; while(ls < x.first) replacementSeq[l++] =ls++; ls++; } }else{ sort(gondolaSeq , gondolaSeq + n); for(int i = 0 ; i < n ; ++i){ replacementSeq[l++] = i + 1; while(ls < gondolaSeq[i]) replacementSeq[l++] =ls++; ls++; } } return l ; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
#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...