Submission #394419

#TimeUsernameProblemLanguageResultExecution timeMemory
394419Theo830Meetings (IOI18_meetings)C++17
0 / 100
21 ms1560 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll INF = 1e18+7; ll MOD = 998244353; typedef pair<ll,ll> ii; #define iii pair<ll,ii> #define f(i,a,b) for(ll i = a;i < b;i++) #define pb push_back #define vll vector<ll> #define F first #define S second #define all(x) (x).begin(), (x).end() ///I hope I will get uprating and don't make mistakes ///I will never stop programming ///sqrt(-1) Love C++ ///Please don't hack me ///@TheofanisOrfanou Theo830 ///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst) ///Stay Calm ///Look for special cases ///Beware of overflow and array bounds ///Think the problem backwards ///Training #include "meetings.h" std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,std::vector<int> R) { int Q = L.size(); ll n = H.size(); vector<long long> C(Q); f(k,0,Q){ ll ans = INF; bool ivra = 0; ll l = L[k]; while(l <= R[k] && H[l] == 1){ l++; } ll r = R[k]; while(r >= L[k] && H[r] == 1){ r--; } ans = R[k] - L[k] + 1; if(l <= r){ ans += r - l + 1; } C[k] = ans; } return C; }

Compilation message (stderr)

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:32:10: warning: unused variable 'ivra' [-Wunused-variable]
   32 |     bool ivra = 0;
      |          ^~~~
meetings.cpp:28:6: warning: unused variable 'n' [-Wunused-variable]
   28 |   ll n = H.size();
      |      ^
#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...