Submission #636600

#TimeUsernameProblemLanguageResultExecution timeMemory
636600stoyan_malininPeru (RMI20_peru)C++14
Compilation error
0 ms0 KiB
#include "peru.h" #ifdef _LOCAL_ #include "grader.cpp" #endif // _LOCAL_ #include <cassert> #include <vector> #include <deque> #include <set> using namespace std; int rmq(int l, int r, const int *a) { int maxVal = a[l]; for(int i = l+1;i<=r;i++) maxVal = max(maxVal, a[i]); return maxVal; } int convertToAns(const vector<long long> &dp) { long long p23 = 1, ans = 0; const long long mod = 1e9 + 7; for(int i = dp.size()-1;i>=0;i--) { ans = (ans + (dp[i]%mod)*p23)%mod; p23 = (p23*23)%mod; } return ans; } int solve(int n, int k, int* a) { vector <long long> dp(n); dp[0] = a[0]; deque <int> dq = {0}; multiset <int> ms; long long prefMaxVal = a[0]; for(int i = 1;i<n;i++) { dp[i] = 1e18; prefMaxVal = max(prefMaxVal, (long long)a[i]); if(i<k) dp[i] = min(dp[i], prefMaxVal); while(dq.empty()==false && i-dq.front()+1>k) { int j = dq.front(); dq.pop_front(); if(dq.empty()==false) ms.erase(ms.find(dp[j]+a[dq.front()])); } while(dq.empty()==false && a[dq.back()]<=a[i]) { if(dq.size()>=2) ms.erase(ms.find(dp[*prev(prev(dq.end()))] + a[dq.back()])); dq.pop_back(); } if(dq.empty()==false) ms.insert(dp[dq.back()]+a[i]); dq.push_back(i); int last = max(i-k, 0); if(dq.front()>last) dp[i] = min(dp[i], dp[last] + a[dq.front()]); if(ms.empty()==false) dp[i] = min(dp[i], (long long)*ms.begin()); assert(ms.size()==dq.size()-1); cout << "dq:";for(int x: dq) cout << x << " "; cout << '\n'; cout << "ms:";for(int x: ms) cout << x << " "; cout << '\n'; cout << "dp[" << i << "] = " << dp[i] << '\n'; } return convertToAns(dp); }

Compilation message (stderr)

peru.cpp: In function 'int solve(int, int, int*)':
peru.cpp:76:9: error: 'cout' was not declared in this scope
   76 |         cout << "dq:";for(int x: dq) cout << x << " ";
      |         ^~~~
peru.cpp:10:1: note: 'std::cout' is defined in header '<iostream>'; did you forget to '#include <iostream>'?
    9 | #include <set>
  +++ |+#include <iostream>
   10 |