oj.uz

Submission #375042

# Submission time Handle Problem Language Result Execution time Memory
375042 2021-03-08T22:56:51 Z ijxjdjd Salesman (IOI09_salesman) C++14
100 / 100
 1078 ms 59116 KB 
#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)

using namespace std;

using ll = long long;

const int MAXN = (int)(5e5) + 5;
const int INF = (int)(1e9);
vector<pair<int, int>> byTime[MAXN];
int N, U, D, S;

int segDirect[2][4*MAXN];
int segBack[2][4*MAXN];
void pull(int n) {
    for (int j = 0; j < 2; j++) {
        segDirect[j][n] = max(segDirect[j][2*n], segDirect[j][2*n+1]);
        segBack[j][n] = max(segBack[j][2*n], segBack[j][2*n+1]);
    }
}
pair<int, int> query(int l, int r, bool right, int n = 1, int tl = 0, int tr = MAXN-1) {
    if (l > tr || r < tl) {
        return {-INF, -INF};
    }
    else if (l <= tl && tr <= r) {
        return {segDirect[right][n], segBack[right][n]};
    }
    else {
        int tm = (tl + tr)/2;
        auto p1 = query(l, r, right, 2*n, tl, tm);
        auto p2 = query(l, r, right, 2*n+1, tm+1, tr);
        return {max(p1.first, p2.first), max(p1.second, p2.second)};
    }
}
void upd(int i, int val, int n = 1, int tl = 0, int tr = MAXN-1) {
    if (tl == tr) {
            segBack[1][n] = val-U*i;
            segDirect[1][n] = val-U*i+i*(U+D);
            segBack[0][n] = val+D*i;
            segDirect[0][n] = val+D*i-i*(D+U);
    }
    else {
        int tm = (tl + tr)/2;
        if (i <= tm) {
            upd(i, val, 2*n, tl, tm);
        }
        else {
            upd(i, val, 2*n+1, tm+1, tr);
        }
        pull(n);
    }
}
int main() {
//    freopen("input.in", "r", stdin);
	cin.tie(0);
	cin.sync_with_stdio(0);
	cin >> N >> U >> D >> S;
	for (int i = 0; i < N; i++) {
        int T, L, K;
        cin >> T >> L >> K;
        byTime[T].push_back({L, K});
	}
	for (int i = 0; i < 4*MAXN; i++) {
        segBack[0][i] = -INF;
        segBack[1][i] = -INF;
        segDirect[0][i] = -INF;
        segDirect[1][i] = -INF;
	}
	int ans = 0;
	upd(S, 0);
	for (auto& t : byTime) {
        sort(all(t));
        vector<int> res(t.size(), -INF);
        int curDirect = -INF;
        int curBack = -INF;
        int backKeep = -INF;
        int lst = MAXN;
        for (int i = int(t.size())-1; i>=0; i--) {
            auto qs = query(t[i].first, lst-1, false);

            curDirect = max(curDirect, qs.first) + t[i].second;
            curBack = max(curBack, backKeep + qs.second);

            res[i] = max(res[i], curDirect+U*t[i].first);
            res[i] = max(res[i], curBack+U*t[i].first+t[i].second);

            backKeep = max(backKeep, -t[i].first*(D+U));
            backKeep += t[i].second;
            curBack += t[i].second;

            lst = t[i].first;
        }

        curDirect = -INF;
        curBack = -INF;
        backKeep = -INF;
        lst = -1;
        for (int i = 0; i < t.size(); i++) {
            auto qs = query(lst+1, t[i].first, true);

            curDirect = max(curDirect, qs.first) + t[i].second;
            curBack = max(curBack, backKeep + qs.second);

            res[i] = max(res[i], curDirect - D*t[i].first);
            res[i] = max(res[i], curBack - D*t[i].first + t[i].second);


            backKeep = max(backKeep, t[i].first*(D+U));
            backKeep += t[i].second;
            curBack += t[i].second;

            lst = t[i].first;
        }
        for (int i = 0; i < t.size(); i++) {
            if (t[i].first < S) {
                ans = max(ans, res[i] - (S-t[i].first)*D);
            }
            else {
                ans = max(ans, res[i] - (t[i].first-S)*U);
            }
            upd(t[i].first, res[i]);
        }
	}
	cout << ans << '\n';
	return 0;
}

Compilation message

salesman.cpp: In function 'int main()':
salesman.cpp:99:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |         for (int i = 0; i < t.size(); i++) {
      |                         ~~^~~~~~~~~~
salesman.cpp:115:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |         for (int i = 0; i < t.size(); i++) {
      |                         ~~^~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 43500 KB Output is correct
2 Correct 30 ms 43372 KB Output is correct
3 Correct 32 ms 43372 KB Output is correct
4 Correct 33 ms 43500 KB Output is correct
5 Correct 37 ms 43628 KB Output is correct
6 Correct 72 ms 44012 KB Output is correct
7 Correct 138 ms 44908 KB Output is correct
8 Correct 238 ms 46572 KB Output is correct
9 Correct 351 ms 48108 KB Output is correct
10 Correct 570 ms 52860 KB Output is correct
11 Correct 670 ms 52988 KB Output is correct
12 Correct 867 ms 56004 KB Output is correct
13 Correct 868 ms 56048 KB Output is correct
14 Correct 1028 ms 59116 KB Output is correct
15 Correct 905 ms 59116 KB Output is correct
16 Correct 1078 ms 59104 KB Output is correct
17 Correct 31 ms 43372 KB Output is correct
18 Correct 32 ms 43372 KB Output is correct
19 Correct 32 ms 43372 KB Output is correct
20 Correct 33 ms 43372 KB Output is correct
21 Correct 33 ms 43372 KB Output is correct
22 Correct 36 ms 43500 KB Output is correct
23 Correct 36 ms 43500 KB Output is correct
24 Correct 36 ms 43500 KB Output is correct
25 Correct 200 ms 44524 KB Output is correct
26 Correct 350 ms 45676 KB Output is correct
27 Correct 531 ms 47324 KB Output is correct
28 Correct 680 ms 47516 KB Output is correct
29 Correct 777 ms 48364 KB Output is correct
30 Correct 788 ms 48736 KB Output is correct