Submission #164200

#TimeUsernameProblemLanguageResultExecution timeMemory
164200dantoh000Gondola (IOI14_gondola)C++14
20 / 100
56 ms4872 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { int anchor[n]; unordered_set<int> s; int last = -1; for (int i = 0; i < n; i++){ s.insert(inputSeq[i]); if (inputSeq[i] > n) continue; anchor[i] = (i+n-inputSeq[i])%n; //printf("%d ",anchor[i]); if (last == -1){ last = anchor[i]; } else{ if (last != anchor[i]) return 0; } } if (s.size() != n) return 0; return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return 0; } int countReplacement(int n, int inputSeq[]) { return 0; }

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:21:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (s.size() != n) return 0;
         ~~~~~~~~~^~~~
#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...