Submission #233365

#	Time	Username	Problem	Language	Result	Execution time	Memory
233365		kartel	Segway (COI19_segway)	C++14	0 / 100	5 ms	384 KiB

segway

#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], l[N], rast[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;
        l[i] = 1;
    }

    cin >> m;

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

    int tm = 1;
    j = 1;

    while (1)
    {
        i = 1;
        while (i <= n && rast[i] >= 300) i++;
        if (i > n) break;

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

        for (i = 1; i <= n; i++)
        {
            if (point[l[i]] == rast[i])
            {
                int kl = 0;
                for (j = 1; j <= n; j++)
                    if (i != j && rast[j] > rast[i]) kl++;
                kl %= 20;
                p[i] = kl;
                l[i]++;
            }
        }

        tm++;
    }

    for (i = 1; i <= n; i++) cout << ans[i] << el;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 45