제출 #484367

#제출 시각아이디문제언어결과실행 시간메모리
484367melon940925Aliens (IOI16_aliens)C++14
0 / 100
0 ms332 KiB
#include<bits/stdc++.h> #define pii pair<int,int> #define x first #define y second using namespace std; typedef long long ll; pii aliens[500001]; ll dp[500001]; ll Q[500001]; ll candidates[500001]; ll numOfArea[500001]; ll front, rear; ll N, K; ll cost(ll a, ll b) { return (aliens[b].x - aliens[a].y) * (aliens[b].x - aliens[a].y); } ll func(ll i, ll j) { return dp[i] + cost(i + 1, j); } ll cross(ll i, ll j) { ll l = j + 1, r = N + 1; while (l > r) { ll m = l + r >> 1; if (func(i, m) <= func(j, m))l = m + 1; else r = m; } return l - 1; } void monotoneQueueOpt(ll m) { front = 0, rear = 1, Q[0] = 0, candidates[0] = N; for (int i = 1; i <= N; ++i) { while (candidates[front] < i)front++; dp[i] = func(Q[front], i) + m; numOfArea[i] = numOfArea[Q[front]] + 1; while (front + 1 < rear && cross(Q[rear - 1], i) < candidates[rear-2])rear--; candidates[rear] = N, candidates[rear - 1] = cross(Q[rear - 1], i), Q[rear++] = i; } } ll bs(ll l, ll r) { if (l >= r)return l; ll mid = l + r >> 1; monotoneQueueOpt(mid); if (numOfArea[N] >= K)return bs(mid + 1, r); return bs(l, mid); } long long take_photos(int n, int m, int k, vector<int> r, vector<int> c) { //preprocess N = n, K = k; vector<pii> tmpAliens; for (int i = 0; i < n; ++i) { int x = r[i], y = c[i]; if (x < y)swap(x, y); tmpAliens.push_back({ x,y }); } sort(tmpAliens.begin(), tmpAliens.end(), [](const pii& a, const pii& b) { if (a.y == b.y)return a.x > b.x; return a.y < b.y; }); pii prv = { -1,-1 }; int idx = 0; for (auto& i : tmpAliens) { if (prv.y <= i.y && i.x <= prv.x)continue; prv = i; aliens[++idx] = i; } //preprocess end ll M = bs(0, 1e14); monotoneQueueOpt(M); return dp[n] - M * K; }

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

aliens.cpp: In function 'll cross(ll, ll)':
aliens.cpp:26:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |   ll m = l + r >> 1;
      |          ~~^~~
aliens.cpp: In function 'll bs(ll, ll)':
aliens.cpp:46:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |  ll mid = l + r >> 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...