Submission #233389

# Submission time Handle Problem Language Result Execution time Memory
233389 2020-05-20T11:04:23 Z kartel Segway (COI19_segway) C++14
100 / 100
679 ms 2620 KB
#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 +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
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 a[N][20], cur, i, j, k, n, m, point[N], ans[N], p[N];

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;
    for (i = 1; i <= n; i++)
    {
        cin >> a[i][1] >> a[i][2] >> a[i][3];
        p[i] = 0;
        ans[i] = 0;
    }

    cin >> m;

    for (i = 1; i <= m; i++) cin >> point[i];

    int rast = 0;
    j = 1;

    while (rast < 300)
    {

        if (point[j] != rast)
        {
            for (i = 1; i <= n; i++)
            {
                if (p[i])
                {
                    p[i]--;
                    ans[i]++;
                }
                else
                {
                    if (rast < 100) ans[i] += a[i][1];
                    else if (rast < 200) ans[i] += a[i][2];
                    else if (rast < 300) ans[i] += a[i][3];
                }
            }
        }
        else
        {
            vector <pii> vec;
            for (i = 1; i <= n; i++) vec.pb({ans[i], i});

            sort(vec.begin(), vec.end());

            int kl = 0;

            for (i = 0; i < n; i++)
            {
                int k = vec[i].S;
                if (p[k] == 0) p[k] += kl % 20;
                if (i + 1 < n && vec[i + 1].F != vec[i].F) kl = i + 1;
            }

            for (i = 1; i <= n; i++)
            {
                if (p[i])
                {
                    p[i]--;
                    ans[i]++;
                }
                else
                {
                    if (rast < 100) ans[i] += a[i][1];
                    else if (rast < 200) ans[i] += a[i][2];
                    else if (rast < 300) ans[i] += a[i][3];
                }
            }
            j++;
        }
        rast++;
    }

    for (i = 1; i <= n; i++) cout << ans[i] << el;
}
# 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 7 ms 640 KB Output is correct
5 Correct 22 ms 2432 KB Output is correct
# 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 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
# 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 7 ms 640 KB Output is correct
5 Correct 22 ms 2432 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 56 ms 632 KB Output is correct
19 Correct 101 ms 1360 KB Output is correct
20 Correct 31 ms 1608 KB Output is correct
21 Correct 186 ms 1964 KB Output is correct
22 Correct 465 ms 2608 KB Output is correct
23 Correct 679 ms 2620 KB Output is correct