제출 #374535

#제출 시각아이디문제언어결과실행 시간메모리
374535vishesh312곤돌라 (IOI14_gondola)C++17
20 / 100
36 ms4844 KiB
#include "bits/stdc++.h" using namespace std; #include "gondola.h" int replacement(int n, int a[], int b[]) {return 0;} int countReplacement(int n, int a[]) {return 0;} int valid(int n, int arr[]) { map<int, bool> mp; vector<int> v(arr, arr+n); auto it = min_element(v.begin(), v.end()); rotate(v.begin(), it, v.end()); for (int i = 0; i < n; ++i) { if (mp[v[i]]) return 0; mp[v[i]] = true; if (v[i] <= n and i != v[i] - v[0]) return 0; } return 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...