Submission #246136

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
246136	2020-07-08T09:22:01 Z	kartel	Go (COCI18_go)	C++14	60 / 100	5 ms	384 KB

go

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +200500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int ans, cur, sum, i, j, l, le, ri, t, ti[N], cost[N], h[N], n, st, m;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
//
//    in("input.txt");
//    out("output.txt");

    cin >> n >> st >> m;
    for (i = 1; i <= m; i++)
        cin >> h[i] >> cost[i] >> ti[i];

    l = 1;
    while (l <= m && h[l] < st) l++;

    l--;
    sum = 0;

    for (le = l; le >= 1; le--)
      {
          t = abs(st - h[le]);

          if (ti[le] > t)
            sum += cost[le];

          cur = sum;
          for (ri = l + 1; ri <= m; ri++)
            {
                int tim = t + abs(h[ri] - h[le]);

                if (tim < ti[ri])
                    cur += cost[ri];

                ans = max(ans, cur);
            }
      }

    sum = 0;

    for (ri = l + 1; ri <= m; ri++)
    {
        t = abs(st - h[ri]);

        if (ti[ri] > t)
            sum += cost[le];

        cur = sum;
        for (le = l; le >= 1; le--)
        {
            int tim = t + abs(h[le] - h[ri]);

            if (tim < ti[le])
                cur += cost[le];

            ans = max(ans, cur);
        }
    }
    t = 0;
    cur = 0;

    for (le = l; le >= 1; le--)
        {
            int tim = t + abs(h[le] - st);

            if (tim < ti[le])
                cur += cost[le];

            ans = max(ans, cur);
        }
    cur = t = 0;
    for (ri = l + 1; ri <= m; ri++)
        {
            int tim = t + abs(h[ri] - st);

            if (tim < ti[ri])
                cur += cost[ri];

            ans = max(ans, cur);
        }

    cout << ans;
}
//
//00000
//00110
//00111
//00011
//00000

Subtask #1

60.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Incorrect	5 ms	384 KB	Output isn't correct
6	Incorrect	5 ms	384 KB	Output isn't correct
7	Incorrect	5 ms	384 KB	Output isn't correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Incorrect	5 ms	384 KB	Output isn't correct