제출 #397250

#제출 시각아이디문제언어결과실행 시간메모리
397250Antekb식물 비교 (IOI20_plants)C++14
14 / 100
4073 ms8808 KiB
#include "plants.h" #include<bits/stdc++.h> #define pb(x) push_back(x) using namespace std; vector<int> V, V3; void init(int k, std::vector<int> r) { int n=r.size(); k--; V.resize(n); V3.resize(n); auto r2=r; for(int i=0; i<n; i++){ vector<int> V2; for(int j=0; j<n; j++){ if(r2[j]==k){ V2.push_back(j); } } int j=V2[0]; if(V2.size()>1){ for(int l=0; l<V2.size(); l++)if(((V2[(l+1)%(V2.size())]-V2[l]+n)%n)>k)j=V2[(l+1)%V2.size()]; } V[j]=i; r2[j]=-1; for(int l=1; l<=k; l++){ r2[(j-l+n)%n]++; } } r2=r; for(int i=0; i<n; i++){ vector<int> V2; for(int j=0; j<n; j++){ if(r2[j]==k){ V2.push_back(j); } } int j=V2[0]; if(V2.size()>1){ for(int l=V2.size()-1;l>=0; l--)if(((V2[(l+1)%(V2.size())]-V2[l]+n)%n)>k)j=V2[(l+1)%V2.size()]; } V3[j]=i; r2[j]=-1; for(int l=1; l<=k; l++){ r2[(j-l+n)%n]++; } } return; } int compare_plants(int x, int y){ if(V[x]<V[y] && V3[x]<V3[y])return -1; if(V[x]>V[y] && V3[x]>V3[y])return 1; return 0; }

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

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:21:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |       for(int l=0; l<V2.size(); l++)if(((V2[(l+1)%(V2.size())]-V2[l]+n)%n)>k)j=V2[(l+1)%V2.size()];
      |                    ~^~~~~~~~~~
#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...