Submission #288923

#TimeUsernameProblemLanguageResultExecution timeMemory
288923Shafin666Gondola (IOI14_gondola)C++14
10 / 100
14 ms1152 KiB
#include "gondola.h" #include <bits/stdc++.h> #define pb push_back #define pii pair<ll, ll> #define nyan "(=^・ω・^=)" #define read_input freopen("in.txt","r", stdin) #define print_output freopen("out.txt","w", stdout) typedef long long ll; typedef long double ld; using namespace std; int next(int p, int n) { int ret = (p + 1) % n; return (ret == 0)? n : ret; } int valid(int n, int inputSeq[]) { int f = 1, prev = -1; for(int i = 0; i < n; i++) { if(inputSeq[i] >= 1 && inputSeq[i] <= n) { if(prev == -1) prev = inputSeq[i]; else if(next(prev, n) == inputSeq[i]) prev = inputSeq[i]; else f = 0; } } return f; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- 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...