제출 #1302510

#제출 시각아이디문제언어결과실행 시간메모리
1302510kawhietNile (IOI24_nile)C++20
17 / 100
2095 ms5532 KiB
#include <bits/stdc++.h> #include "nile.h" using namespace std; constexpr long long inf = 1e18; vector<long long> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) { int n = w.size(); int q = e.size(); vector<array<int, 3>> to_sort; for (int i = 0; i < n; i++) { to_sort.push_back({w[i], a[i], b[i]}); } sort(to_sort.begin(), to_sort.end()); for (int i = 0; i < n; i++) { w[i] = to_sort[i][0]; a[i] = to_sort[i][1]; b[i] = to_sort[i][2]; } vector<long long> ret; for (auto d : e) { long long ans = n; int sz = 1; for (int i = 1; i < n; i++) { if (w[i] - w[i - 1] <= d) { sz++; } else { ans += (sz & 1); sz = 1; } } ans += (sz & 1); ret.push_back(ans); } return ret; }
#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...