Submission #781307

#TimeUsernameProblemLanguageResultExecution timeMemory
781307vjudge1Meetings (IOI18_meetings)C++17
19 / 100
3931 ms786432 KiB
#include "meetings.h" #include<bits/stdc++.h> using namespace std; vector<long long> minimum_costs(vector<int> H, vector<int> L, vector<int> R) { int n = H.size(); long long C[n][n]; memset(C, 0, sizeof C); for(int i = 0; i < n; i++) { int mx = 0; long long ans = 0; for(int j = i; j < n; j++) C[i][j] = ans += mx = max(mx, H[j]); ans = 0; mx = 0; for(int j = i+1; j--;) C[i][j] = ans += mx = max(mx, H[j]); } vector<long long> ans(L.size(), 1e18); for(int i = 0; i < L.size(); i++) for(int j = L[i]; j <= R[i]; j++) ans[i] = min(ans[i], C[j][L[i]]+C[j][R[i]]-H[j]); return ans; }

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:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 0; i < L.size(); i++)
      |                    ~~^~~~~~~~~~
#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...