제출 #285520

#제출 시각아이디문제언어결과실행 시간메모리
285520erd1곤돌라 (IOI14_gondola)C++14
컴파일 에러
0 ms0 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define all(x) (x).begin(), (x).end() #define pb push_back typedef int64_t lld; typedef pair<int, int> pii; typedef long double ld; int valid(int n, int inputSeq[]) { set<int> uses; for(int i = 0; i < n; i++)if(inputSeq[i] <= n){ rotate(inputSeq, inputSeq+i, inputSeq+n); if(inputSeq[0] != 1) rotate(inputSeq, inputSeq + (n-inputSeq[0]+1), inputSeq + n); break; } for(int i = 0; i < n; i++) if(inputSeq[i] == i+1) continue; else if(inputSeq[i] <= n)return 0; else if(uses.count(inputSeq[i])) return 0; else uses.insert(inputSeq[i]); return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { map<int, int> mp; for(int i = 0; i < n; i++)if(gondolaSeq[i] <= n){ rotate(gondolaSeq, gondolaSeq+i, gondolaSeq+n); if(gondolaSeq[0] != 1) rotate(gondolaSeq, gondolaSeq + (n-gondolaSeq[0]+1), gondolaSeq + n); break; } for(int i = 0; i < n; i++)if(gondolaSeq[i] > n)mp[gondolaSeq[i]] = i+1; int cur = 0; for(auto i: mp){ int l = i.ss; while(cur+n < i.ff) replacementSeq[cur++] = l, l = n+cur; } return cur; } //---------------------- int countReplacement(int n, int inputSeq[]) { if(!isValid(n, inputSeq))return 0; }

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:47:7: error: 'isValid' was not declared in this scope; did you mean 'valid'?
   47 |   if(!isValid(n, inputSeq))return 0;
      |       ^~~~~~~
      |       valid
gondola.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
   49 | }
      | ^