Submission #239756

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
239756	2020-06-17T09:02:59 Z	Vimmer	Go (COCI18_go)	C++14	80 / 100	387 ms	504 KB

go

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 101001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


vector <pair <int, int> > g[1005];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k, m;

    cin >> n >> k >> m;

    for (int i = 0; i < m; i++) {int x, y, z; cin >> x >> y >> z; g[x].pb({z, y});}

    for (int i = 1; i <= n; i++) sort(g[i].begin(), g[i].end());

    int ans = 0;

    for (int i = 1; i <= k; i++)
    {
        int sum = 0, tmr = k - i + 1;

        for (int j = i; j <= k; j++, tmr--)
            for (auto it : g[j])
              if (tmr <= it.F) sum += it.S;

        tmr = (k - i + 1) * 2;

        for (int j = k + 1; j <= n; j++, tmr++)
            for (auto it : g[j])
              if (tmr <= it.F) sum += it.S;

        ans = max(ans, sum);
    }

    for (int i = k; i <= n; i++)
    {
        int sum = 0;

        int tmr = i - k + 1;

        for (int j = i; j >= k; j--, tmr--)
            for (auto it : g[j])
              if (tmr <= it.F) sum += it.S;

        tmr = (i - k + 1) * 2;

        for (int j = k - 1; j >= 0; j--, tmr++)
            for (auto it : g[j])
              if (tmr <= it.F) sum += it.S;

        ans = max(ans, sum);
    }

    for (int i = 1; i <= k; i++)
        for (int j = k + 1; j <= n; j++)
        {
            int tmr = 1, sum = 0;

            for (int u = k; u >= i; u--, tmr++)
              for (auto it : g[u])
                  if (tmr <= it.F) sum += it.S;

            tmr += k - i;

            for (int u = k + 1; u <= j; u++, tmr++)
               for (auto it : g[u])
                  if (tmr <= it.F) sum += it.S;

            tmr += j - i;

            for (int u = i; u >= 1; u--, tmr++)
                for (auto it : g[u])
                  if (tmr <= it.F) sum += it.S;

            ans = max(ans, sum);

            tmr = 1, sum = 0;

            for (int u = k; u <= j; u++, tmr++)
                for (auto it : g[u])
                  if (tmr <= it.F) sum += it.S;

            tmr += j - k;

            for (int u = k - 1; u >= i; u--, tmr++)
                for (auto it : g[u])
                  if (tmr <= it.F) sum += it.S;

            tmr += j - i;

            for (int u = j + 1; u <= n; u++, tmr++)
                for (auto it : g[u])
                  if (tmr <= it.F) sum += it.S;

            ans = max(ans, sum);
        }

    cout << ans << endl;
}

Subtask #1

80.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	73 ms	384 KB	Output is correct
2	Correct	39 ms	504 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	48 ms	384 KB	Output is correct
5	Incorrect	51 ms	384 KB	Output isn't correct
6	Incorrect	6 ms	384 KB	Output isn't correct
7	Correct	387 ms	408 KB	Output is correct
8	Correct	331 ms	384 KB	Output is correct
9	Correct	42 ms	384 KB	Output is correct
10	Correct	200 ms	504 KB	Output is correct