제출 #104101

#제출 시각아이디문제언어결과실행 시간메모리
104101turbat커다란 상품 (IOI17_prize)C++14
0 / 100
80 ms316 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; using vi = vector <int>; using pii = pair <int, int>; #define pb push_back #define mp make_pairdefine F first #define S second #define N 200005 int mx; int fen[N]; void add(int x){ x++; while (x < N){ fen[x]++; x += x & -x; } } int sum(int x){ x++; int s = 0; while (x){ s += fen[x]; x -= x & -x; } return s; } int gg(int l, int r){ vi tmp; if (l == r) { tmp = ask(l); if (tmp[0] + tmp[1] == 0) return l; return -1; } while(l <= r){ tmp = ask(r); if (tmp[0] + tmp[1] == 0) return r; if (tmp[0] + tmp[1] == mx) break; add(r); r--; } if (l > r) return -1; if (tmp[0] == sum(l - 1)) return -1; if (l == r) return gg(l, r); int mid = (l + r) / 2; return max(gg(l, mid), gg(mid + 1, r)); } int find_best(int n) { int s[505]; // for (int i = 0;i < 500;i++){ // vi ans = ask(i); // s[i] = ans[0] + ans[1]; // if (!s[i]) return i; // mx = max(mx, s[i]); // } // for (int i = 0;i * i < n;i++) // if (s[i] != mx) // add(i); vi ans = ask(0); mx = ans[0] + ans[1]; return gg(0, n - 1); }

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:49:6: warning: unused variable 's' [-Wunused-variable]
  int s[505];
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...