제출 #605318

#제출 시각아이디문제언어결과실행 시간메모리
605318MohamedAliSaidane버섯 세기 (IOI20_mushrooms)C++14
0 / 100
141 ms384 KiB
#include <bits/stdc++.h> #include "mushrooms.h" using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pii> vpi; typedef vector<pll> vpl; #define pb push_back #define popb pop_back #define all(x) (x).begin(),(x).end() //int use_machine(vi); int count_mushrooms(int n) { if(n == 2) { vi U; U.pb(0); U.pb(1); if(use_machine(U)) return 2; else return 1; } int ans[n]; memset(ans, 0,sizeof(ans)); ans[0] = 1; vi U; U.pb(0); U.pb(1); if(use_machine(U)) ans[1] = 0; else ans[1] = 1; U.popb(); U.pb(2); if(use_machine(U)) ans[2] = 0; else ans[2] = 1; int ones = ans[0] + ans[1] + ans[2]; if(ones == 1) { int a = 1; int b = 2; for(int i = 3; i < n - 1; i += 2) { vi V; V.pb(1); V.pb(i); V.pb(2); V.pb(i + 1); int rep = use_machine(V); if(rep == 1) { ans[i] = ans[1]; ans[i + 1] = 1 - ans[1]; } else if(rep == 2) { ans[i] = 1 - ans[1]; ans[i + 1] = ans[1]; } else if(rep == 3) { ans[i] = 1 - ans[1]; ans[i + 1] = 1 - ans[1]; } else { ans[i] = ans[1]; ans[i + 1] = ans[1]; } } if(n%2 == 0) { ans[n - 1] = use_machine({1, n - 1}); } } else { int a = 0; int b = ans[1] ? 1: 2; for(int i = 3; i < n - 1; i += 2) { vi V; V.pb(0); V.pb(i); V.pb(b); V.pb(i + 1); int rep = use_machine(V); if(rep == 1) { ans[i] = ans[0]; ans[i + 1] = 1 - ans[0]; } else if(rep == 2) { ans[i] = 1 - ans[0]; ans[i + 1] = ans[0]; } else if(rep == 3) { ans[i] = 1 - ans[0]; ans[i + 1] = 1 - ans[0]; } else { ans[i] = ans[0]; ans[i + 1] = ans[0]; } } if(n%2 == 0) { ans[n - 1] = 1 - use_machine({0, n - 1}); } } int fin = 0 ; for(int i = 0 ; i < n; i++) fin += ans[i]; return fin; } /* int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); } */ /* static char fmt_buffer[100000]; #define FMT_TO_STR(fmt, result) va_list vargs; va_start(vargs, fmt); \ vsnprintf(fmt_buffer, sizeof(fmt_buffer), fmt, vargs); \ va_end(vargs); fmt_buffer[sizeof(fmt_buffer)-1] = 0; \ std::string result(fmt_buffer); static const int min_n = 2; static const int max_n = 20000; static const int max_qc = 20000; static const int max_qs = 100000; static const int species_A = 0; static const int species_B = 1; static int n; static std::vector<int> species; static int qc, qs; static inline void error_if(bool cond, std::string message) { if (cond) { printf("%s\n", message.c_str()); exit(0); } } static inline void wrong_if(bool cond, std::string message) { error_if(cond, "Wrong Answer: "+message); } int use_machine(std::vector<int> x) { const int xs = x.size(); wrong_if(xs < 2, "Too small array for query."); wrong_if(xs > n, "Too large array for query."); qc++; wrong_if(qc > max_qc, "Too many queries."); qs += xs; wrong_if(qs > max_qs, "Too many total array sizes as queries."); for (int i = 0; i < xs; i++) wrong_if(x[i] < 0 || n - 1 < x[i], "Invalid value in the query array."); std::vector<bool> used(n, false); for (int i = 0; i < xs; i++) { wrong_if(used[x[i]], "Duplicate value in the query array."); used[x[i]] = true; } int diffs = 0; for (int i = 1; i < xs; i++) diffs += int(species[x[i]] != species[x[i-1]]); return diffs; } #ifdef __GNUC__ __attribute__ ((format(printf, 2, 3))) #endif static inline void check_input(bool cond, const char* message_fmt, ...) { FMT_TO_STR(message_fmt, message); error_if(!cond, "Invalid input: "+message); } int main() { check_input(1 == scanf("%d", &n), "Could not read n."); check_input(min_n <= n, "n must not be less than %d, but it is %d.", min_n, n); check_input(n <= max_n, "n must not be greater than %d, but it is %d.", max_n, n); species.resize(n); for (int i = 0; i < n; i++) { check_input(1 == scanf("%d", &species[i]), "Could not read species element [%d].", i); check_input(species[i]==species_A || species[i] == species_B, "Species elements must be %d or %d, but species element [%d] is %d.", species_A, species_B, i, species[i]); } check_input(species[0] == species_A, "Species element [%d] must be %d.", 0, species_A); // Postponed closing standard input in order to allow interactive usage of the grader. qc = 0; qs = 0; int answer = count_mushrooms(n); printf("%d\n%d\n", answer, qc); fclose(stdout); fclose(stdin); return 0; } */

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

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:51:17: warning: unused variable 'a' [-Wunused-variable]
   51 |             int a  = 1;
      |                 ^
mushrooms.cpp:52:17: warning: unused variable 'b' [-Wunused-variable]
   52 |             int b = 2;
      |                 ^
mushrooms.cpp:90:17: warning: unused variable 'a' [-Wunused-variable]
   90 |             int a  = 0;
      |                 ^
#Verdict Execution timeMemoryGrader output
Fetching results...