제출 #696143

#제출 시각아이디문제언어결과실행 시간메모리
696143n0sk1ll곤돌라 (IOI14_gondola)C++17
10 / 100
26 ms5080 KiB
#include <bits/stdc++.h> #define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0) #define mp make_pair #define xx first #define yy second #define pb push_back #define pf push_front #define popb pop_back #define popf pop_front #define all(x) (x).begin(),(x).end() #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++) #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++) #define bff(i,a,b) for (int (i) = (b)-1; (i) >= (a); (i)--) #define bfff(i,a,b) for (int (i) = (b); (i) >= (a); (i)--) using namespace std; long double typedef ld; unsigned int typedef ui; long long int typedef li; pair<int,int> typedef pii; pair<li,li> typedef pli; pair<ld,ld> typedef pld; vector<vector<int>> typedef graph; unsigned long long int typedef ull; const int mod = 998244353; //const int mod = 1000000007; //Note to self: Check for overflow #include "gondola.h" int valid(int n, int a[]) { set<int> gondola; for (int i=0;i<n;i++) gondola.insert(a[i]); if (gondola.size()!=n) return 0; vector<int> tmp; ff(i,0,n) if (a[i]<=n) tmp.pb(a[i]); if (tmp.empty()) return 1; int kolko=0; ff(i,1,n) if (tmp[i-1]<tmp[i]) kolko++; if (tmp[n-1]<tmp[0]) kolko++; return kolko==(int)tmp.size()-1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return 0; } int countReplacement(int n, int inputSeq[]) { return 0; } /*int main() { FAST; } */

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:43:23: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |     if (gondola.size()!=n) return 0;
      |         ~~~~~~~~~~~~~~^~~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:46:5: note: in expansion of macro 'ff'
   46 |     ff(i,0,n) if (a[i]<=n) tmp.pb(a[i]);
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:49:5: note: in expansion of macro 'ff'
   49 |     ff(i,1,n) if (tmp[i-1]<tmp[i]) kolko++;
      |     ^~
#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...