oj.uz

답안 #233379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233379 2020-05-20T10:56:21 Z kartel Segway (COI19_segway) C++14
15 / 100
 26 ms 2424 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 + 1 <= 100) ans[i] += a[i][1];
                    else if (rast + 1 <= 200) ans[i] += a[i][2];
                    else if (rast + 1 <= 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;
                p[k] = (kl % 20);
                if (i + 1 < n && vec[i + 1].F == vec[i].F) kl--;
                                                      else kl = i;
                kl++;
            }

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

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

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 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 768 KB Output is correct
5 Correct 26 ms 2424 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 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 768 KB Output is correct
5 Correct 26 ms 2424 KB Output is correct
6 Incorrect 5 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -