제출 #817379

#제출 시각아이디문제언어결과실행 시간메모리
817379jlallas384식물 비교 (IOI20_plants)C++17
14 / 100
4070 ms8628 KiB
#include "plants.h" #include <bits/stdc++.h> using namespace std; vector<int> ans; void init(int k, std::vector<int> r) { int n = r.size(); ans.resize(n); for(int val = n - 1; val >= 0; val--){ vector<int> a; for(int i = 0; i < n; i++){ if(r[i] == 0){ a.push_back(i); } } int bst = -1; for(int i = 0; i < a.size(); i++){ int prv = (i - 1 + a.size()) % a.size(); int d = (i == 0 ? a[i] + n - a[prv] : a[i] - a[prv]); if(d >= k){ assert(bst == -1); bst = a[i]; } } ans[bst] = val; r[bst] = 1e9; for(int i = 1; i < k; i++){ int id = (bst - i + n) % n; r[id] = max(r[id] - 1, 0); } } } int compare_plants(int x, int y) { if(ans[x] > ans[y]) return 1; else return -1; }

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

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