제출 #897681

#제출 시각아이디문제언어결과실행 시간메모리
897681Essa2006버섯 세기 (IOI20_mushrooms)C++14
컴파일 에러
0 ms0 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define endl '\n' #define FF first #define SS second #define all(a) a.begin(), a.end() #define mod (ll)(1000000007) //#include "mushrooms.h" int cnt = 0; vector<int> B; int use_machine(vector<int> X) { cnt++; int res = 0; for (int i = 1; i < X.size(); i++) { if (B[X[i]] != B[X[i - 1]]) { res++; } } return res; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int count_mushrooms(int n) { vector<int> A(n); vector<int> Z = {0}, O; for (int i = 0; i < n; i++) { A[i] = i; } shuffle(A.begin() + 1, A.end(), rng); int ans = 1, vr = 94; int last; for (int i = 1; i <= 2 * vr; i++){ last = i; int cur = use_machine({Z.front(), A[i]}); if (cur) { O.push_back(A[i]); } else { Z.push_back(A[i]); ans++; } if (n == i + 1) { return ans; } } int i = last + 1; while (i < n - 1) { int j = i; vector<int>Ask; if (Z.size() > O.size()) { while (j < n){ Ask.push_back(A[j]); if (Z.size() < j - i + 1 || j == n - 1) { j++; break; } Ask.push_back(Z[j - i]); j++; } int diff = use_machine(Ask); int all = (Ask.size() + 1) / 2; if (diff & 1) { int Bs = (diff + 1) / 2; ans += all - Bs; } else { int diff2 = use_machine({Z.front(), A[i]}); if (diff2) { O.push_back(A[i]); O.push_back(A[j - 1]); ans += all - (diff + 2)/ 2; } else { Z.push_back(A[i]); Z.push_back(A[j - 1]); ans += all - diff / 2; } } } else { while (j < n){ Ask.push_back(A[j]); if (O.size() < j - i + 1 || j == n - 1) { j++; break; } Ask.push_back(O[j - i]); j++; } int diff = use_machine(Ask); int all = (Ask.size() + 1) / 2; if (diff & 1) { int As = (diff + 1) / 2; ans += As; } else { int diff2 = use_machine({O.front(), A[i]}); if (diff2) { Z.push_back(A[i]); Z.push_back(A[j - 1]); ans += (diff / 2 + 1); } else { O.push_back(A[i]); O.push_back(A[j - 1]); ans += diff / 2; } } } i = j; } if (i == n - 1) { int diff = use_machine({Z.front(), A[i]}); ans += 1 - diff; } return ans; } int main() { int mn = 1; for (int i = 1; i < 200 ; i++) { if (2 * i + 20000 / i < 2 * mn + 20000 / mn) { mn = i; } } cout << mn; }

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

mushrooms.cpp: In function 'int use_machine(std::vector<int>)':
mushrooms.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 1; i < X.size(); i++) {
      |                     ~~^~~~~~~~~~
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:65:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |                 if (Z.size() < j - i + 1 || j == n - 1) {
      |                     ~~~~~~~~~^~~~~~~~~~~
mushrooms.cpp:96:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   96 |                 if (O.size() < j - i + 1 || j == n - 1) {
      |                     ~~~~~~~~~^~~~~~~~~~~
mushrooms.cpp:104:17: warning: unused variable 'all' [-Wunused-variable]
  104 |             int all = (Ask.size() + 1) / 2;
      |                 ^~~
/usr/bin/ld: /tmp/ccnRd20k.o: in function `use_machine(std::vector<int, std::allocator<int> >)':
stub.cpp:(.text+0x210): multiple definition of `use_machine(std::vector<int, std::allocator<int> >)'; /tmp/cci59Z1j.o:mushrooms.cpp:(.text+0x0): first defined here
/usr/bin/ld: /tmp/ccnRd20k.o: in function `main':
stub.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cci59Z1j.o:mushrooms.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status