Submission #1199164

#TimeUsernameProblemLanguageResultExecution timeMemory
1199164theyeiaMeetings (IOI18_meetings)C++20
17 / 100
2524 ms5048 KiB
#include "meetings.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using pi = pair<int,int>; const int MOD = 1e9 + 7; #define F first #define S second #define sz(x) int((x).size()) #define sor(x) sort(begin(x), end(x)) #define FOR(i, a, b) for (int i = a; i < b; i++) vi H, L, R; vector<ll> minimum_costs(vi H0, vi L0, vi R0) { int n = H0.size(), q = L0.size(); vector<ll> Ans(q); for (auto h : H0) H.push_back(h); for (auto l : L0) L.push_back(l); for (auto r : R0) R.push_back(r); FOR(i, 0, q) { int l = L[i], r = R[i]; int cur = 0, mx = 0; FOR(j, l, r + 1) { if (H[j] == 2) cur = 0; else cur++; mx = max(mx, cur); } Ans[i] = 2 * (r - l + 1) - mx; } return Ans; } //#include "grader.cpp"
#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...