제출 #128706

#제출 시각아이디문제언어결과실행 시간메모리
128706Just_Solve_The_Problem자동 인형 (IOI18_doll)C++11
18 / 100
40 ms10032 KiB
#include <bits/stdc++.h> #include "doll.h" //#include "grader.cpp" using namespace std; const int maxn = (int)5e5 + 7; int sz; void solve5(int M, vector<int> A) { int N = A.size(); vector<int> C(M + 1); vector<int> X, Y; C[0] = A[0]; int tmp = N - 1; while (tmp > 0) { sz++; tmp >>= 1; } if (sz) C[1] = -1; else C[1] = 0; X.resize(sz); Y.resize(sz); tmp = N - 1; for (int i = 1; i <= sz; i++) { if ((tmp >> (sz - i)) & 1) { X[i - 1] = A[0]; } else { X[i - 1] = -1; } Y[i - 1] = ((i == sz) ? 0 : -(i + 1)); } answer(C, X, Y); } int cnt[maxn]; void add(int val, int v, int l, int r, vector<int> &X, vector <int> &Y) { if (l == r) { cnt[v]++; return ; } int mid = (l + r) >> 1; if (cnt[v + v] != cnt[v + v + 1]) { if (l == mid) X[v - 1] = val; add(val, v + v, l, mid, X, Y); } else { if (mid + 1 == r) Y[v - 1] = val; add(val, v + v + 1, mid + 1, r, X, Y); } cnt[v]++; } void solve1234(int M, vector<int> A) { int N = A.size(); vector <int> C(M + 1, 0); vector <int> X, Y; C[0] = A[0]; if (N == 1) { answer(C, X, Y); return ; } int asd = 0; while ((1 << asd) < N) { asd++; } for (int i = 1; i < (1 << asd); i++) { X.push_back(-(i + i)); if (i + i >= (1 << asd - 1)) X.back() = -1; Y.push_back(-(i + i + 1)); if (i + i + 1 >= (1 << asd - 1)) Y.back() = -1; } for (int i = 0; i < N; i++) { C[A[i]] = -1; } add(0, 1, 0, (1 << asd) - 1, X, Y); for (int i = N - 1; i > 0; i--) { add(A[i], 1, 0, (1 << asd) - 1, X, Y); } answer(C, X, Y); } void create_circuit(int M, vector<int> A) { if (M == 1) { solve5(M, A); } else { solve1234(M, A); } } /* 2 16 1 1 1 1 2 2 2 2 1 1 1 1 2 2 2 2 4 2 1 2 */

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

doll.cpp: In function 'void solve1234(int, std::vector<int>)':
doll.cpp:70:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   70 |   if (i + i >= (1 << asd - 1)) X.back() = -1;
      |                      ~~~~^~~
doll.cpp:72:30: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   72 |   if (i + i + 1 >= (1 << asd - 1)) Y.back() = -1;
      |                          ~~~~^~~
#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...