제출 #432898

#제출 시각아이디문제언어결과실행 시간메모리
432898REALITYNB곤돌라 (IOI14_gondola)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n ,int* a){ set<int> el ; for(int i=0;i<n;i++) el.insert(a[i]) ; if(el.size()!=n) return 0 ; bool flg= 0 ; for(int i=0;i<n;i++){ if(a[i]>n) continue; for(int j=i;j<n+i;j++){ if(a[j%n]>n) continue ; if(a[j%n]==((a[i]+j-i)<=n?a[i]+j-i:a[i]+j-i-n)) continue ; return 0; } break ; } return 1 ; } int replacementSeq(int n , int* a , int* ans){ /* map<int,int> occ ; for(int i=0;i<n;i++) occ[a[i]]=i ; int res = 0 ; int start = n+1 , mx = 0 ; for(int i=0;i<n;i++) mx =max(mx,a[i]) ; if(mx<=n) return 0 ; int i = 0 ; int j= 0; while(1){ if(occ.count(start)==0){ ans[i]=j; } else{ ans[i]= } if(start==mx) break ; ++start,++i ; } */ return 1; } int countReplacement(int n,int* a){ const int md = 1e9+9 ; if(valid(n,a)==0) return 0 ; int spots = 0 ; for(int i=0;i<n;i++) spots+=(a[i]>n) ; int ans = (spots==n?n:1), mx = 0 ; for(int i=0;i<n;i++) mx = max(mx,a[i]) ; set<int> vis ; for(int i=0;i<n;i++) vis.insert(a[i]) ; for(int i=n+1;i<=mx;i++){ if(vis.count(i)) --spots ; else ans*=spots ; ans%=md ; } return ans ; }

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:7:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    7 |     if(el.size()!=n) return 0 ;
      |        ~~~~~~~~~^~~
gondola.cpp:8:10: warning: unused variable 'flg' [-Wunused-variable]
    8 |     bool flg= 0 ;
      |          ^~~
/usr/bin/ld: /tmp/ccgffhPz.o: in function `main':
grader.cpp:(.text.startup+0x132): undefined reference to `replacement'
collect2: error: ld returned 1 exit status