제출 #1158849

#제출 시각아이디문제언어결과실행 시간메모리
1158849CodeLakVNPilot (NOI19_pilot)C++17
100 / 100
334 ms38992 KiB
#include <bits/stdc++.h> using namespace std; #define task "PILOT" #define FOR(i, a, b) for (int i = (a); i <= (b); i++) #define FOD(i, a, b) for (int i = (a); i >= (b); i--) #define F first #define S second const int N = (int)1e6 + 6; int n, q; pair<int, int> mountains[N], planes[N]; int s[N], e[N]; long long ans[N]; int main() { if (fopen(task".inp", "r")) { freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> q; FOR(i, 1, n) { cin >> mountains[i].F; mountains[i].S = i; } FOR(i, 1, q) { cin >> planes[i].F; planes[i].S = i; } sort(mountains + 1, mountains + n + 1); sort(planes + 1, planes + q + 1); memset(s, 0, sizeof(s)); memset(e, 0, sizeof(e)); long long cur = 0; int i = 1; FOR(j, 1, q) { while (i <= n && mountains[i].F <= planes[j].F) { int id = mountains[i].S; // cout << "mountain: " << id << ", " << mountains[i].F << "\n"; if (s[id - 1] == 0 && e[id + 1] == 0) { s[id] = e[id] = id; cur++; } else if (s[id - 1] && e[id + 1]) { cur += 1LL * (e[id + 1] - (id + 1) + 2) * ((id - 1) - s[id - 1] + 2); e[s[id - 1]] = e[id + 1]; s[e[id + 1]] = s[id - 1]; } else if (s[id - 1] && !e[id + 1]) { cur += 1LL * ((id - 1) - s[id - 1] + 2); e[s[id - 1]] = e[id] = id; s[id] = s[id - 1]; } else if (!s[id - 1] && e[id + 1]) { cur += 1LL * (e[id + 1] - (id + 1) + 2); s[id] = s[e[id + 1]] = id; e[id] = e[id + 1]; } // cout << "cur: " << cur << "\n"; i++; } ans[planes[j].S] = cur; } FOR(j, 1, q) cout << ans[j] << "\n"; return 0; }

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

pilot.cpp: In function 'int main()':
pilot.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
pilot.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...