제출 #1090045

#제출 시각아이디문제언어결과실행 시간메모리
1090045onlk97Comparing Plants (IOI20_plants)C++14
14 / 100
4075 ms8908 KiB
#include "plants.h" #include <bits/stdc++.h> using namespace std; vector <int> p; void init(int k,vector <int> r){ int n=r.size(); p.resize(n); for (int i=n; i; i--){ vector <int> vec; for (int j=0; j<n; j++){ if (!r[j]) vec.push_back(j); } int idx=vec[0]; if (vec.size()>=2){ int g=vec[0]-vec.back()+n; for (int j=1; j<vec.size(); j++){ if (vec[j]-vec[j-1]>g){ g=vec[j]-vec[j-1]; idx=vec[j]; } } } p[idx]=i; r[idx]=1e9; for (int j=0; j<k; j++){ r[idx]--; idx--; if (idx<0) idx+=n; } } } int compare_plants(int x,int y){ if (p[x]>p[y]) return 1; return -1; }

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

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