Submission #814788

#TimeUsernameProblemLanguageResultExecution timeMemory
814788vjudge1코알라 (JOI13_koala)C++17
100 / 100
121 ms12504 KiB
#include<bits/stdc++.h> using namespace std; const int Nmax = 1e5; const int MOD = 1000000007; int numhouse, sta, en; long long maxdis, fee; long long dir[Nmax + 3], val[Nmax + 3], p[Nmax + 3]; map<int, int> newdir; long long dp[Nmax + 3]; vector<int> values; struct SegmentTree{ long long st[(1 << 19) + 3]; void update(int id, int l, int r, int i, long long v){ if(i < l || i > r) return; if(l == r){ st[id] = v; return; } int mid = (l + r) / 2; update(id * 2, l, mid, i, v); update(id * 2 + 1, mid + 1, r, i, v); st[id] = max(st[id * 2], st[id * 2 + 1]); } long long get(int id, int l, int r, int u, int v){ if(v < l || r < u) return -1e18; if(u <= l && r <= v) return st[id]; int mid = (l + r) / 2; return max(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v)); } } segtree; void in(){ cin >> sta >> en >> maxdis >> fee >> numhouse; dir[0] = sta; p[0] = sta % maxdis; values.push_back(p[0]); dir[numhouse + 1] = en; p[numhouse + 1] = en % maxdis; values.push_back(p[numhouse + 1]); for(int i = 1; i <= numhouse; i++){ cin >> dir[i] >> val[i]; p[i] = dir[i] % maxdis; values.push_back(p[i]); } sort(values.begin(), values.end()); values.erase(unique(values.begin(), values.end()), values.end()); for(int i = 0; i < values.size(); i++) { newdir[values[i]] = i + 1; segtree.update(1, 1, values.size(), i + 1, -1e18); } } void sol(){ //dp[i] = max(dp[i], dp[j] - (distance(j, i) / maxdis) * fee + val[i]) // distance(j, i) la khoang cach cua nha j va nha i (j <= i) = dir[i] - dir[j] dp[0] = 0; for(int i = 1; i <= numhouse + 1; i++){ dp[i] = val[i] -((dir[i] - dir[0] + maxdis - 1) / maxdis) * fee; dp[i] = max(dp[i], segtree.get(1, 1, values.size(), newdir[p[i]], values.size()) - (dir[i] / maxdis) * fee + val[i]); dp[i] = max(dp[i], segtree.get(1, 1, values.size(), 1, newdir[p[i]] - 1) - (dir[i] / maxdis + 1) * fee + val[i]); segtree.update(1, 1, values.size(), newdir[p[i]], dp[i] + (dir[i] / maxdis) * fee); } cout << dp[numhouse + 1]; } int main(){ //freopen(" ", "r", stdin); //freopen(" ", "w", stdout); ios_base::sync_with_stdio(false); cin.tie(0); int t = 1; //cin >> t; while(t--){ in(); sol(); } return 0; }

Compilation message (stderr)

koala.cpp: In function 'void in()':
koala.cpp:57:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i = 0; i < values.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...