oj.uz

답안 #1055142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055142 2024-08-12T14:52:53 Z c2zi6 식물 비교 (IOI20_plants) C++14
19 / 100
 4000 ms 8788 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "plants.h"

namespace TEST2 {
    VI a;
    void init(int k, VI r) {
        int n = r.size();
        a = VI(n);
        int mx = n-1;
        while (mx >= 0) {
            bool worked = false;
            rep(i, n) {
                if (r[i] == 0) {
                    bool canbe = true;
                    int ii = i-1;
                    rep(j, k-1) {
                        if (ii == -1) ii = n-1;
                        if (r[ii--] == 0) {
                            canbe = false;
                            break;
                        }
                    }
                    if (!canbe) continue;

                    worked = true;
                    a[i] = mx--;
                    rep(j, k) {
                        if (i == -1) i = n-1;
                        r[i--]--;
                    }
                    break;
                }
            }
            assert(worked);
        }
        /*for (int x : a) cout << x << " "; cout << endl;*/
    }
    int compare_plants(int x, int y) {
        if (a[x] > a[y]) return +1;
        if (a[x] < a[y]) return -1;
        return 0;
    }
};

bool test2;

VI pref;
int n;
void init(int k, VI r) {
    n = r.size();
    test2 = (2 * k > n);
    if (test2) TEST2::init(k, r);
    else {
        pref = VI(2*n+1);
        rep(i, n) pref[i+1] = pref[i] + r[i];
        rep(i, n) pref[i+1+n] = pref[i+n] + r[i];
    }
}

int compare_plants(int x, int y) {
    if (test2) return TEST2::compare_plants(x, y);
    if (pref[y] - pref[x] == 0) return +1;
    if (pref[y] - pref[x] == y - x) return -1;
    if (pref[x+n] - pref[y] == 0) return -1;
    if (pref[x+n] - pref[y] == x+n-y) return +1;
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 28 ms 4060 KB Output is correct
7 Correct 34 ms 5716 KB Output is correct
8 Correct 43 ms 8680 KB Output is correct
9 Correct 42 ms 8640 KB Output is correct
10 Correct 42 ms 8776 KB Output is correct
11 Correct 43 ms 8788 KB Output is correct
12 Correct 45 ms 8784 KB Output is correct
13 Correct 44 ms 8784 KB Output is correct
14 Correct 40 ms 8784 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 70 ms 3172 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 75 ms 3116 KB Output is correct
11 Correct 57 ms 3152 KB Output is correct
12 Correct 56 ms 3408 KB Output is correct
13 Correct 77 ms 3156 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 70 ms 3172 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 75 ms 3116 KB Output is correct
11 Correct 57 ms 3152 KB Output is correct
12 Correct 56 ms 3408 KB Output is correct
13 Correct 77 ms 3156 KB Output is correct
14 Correct 501 ms 3412 KB Output is correct
15 Execution timed out 4074 ms 5876 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 28 ms 4060 KB Output is correct
7 Correct 34 ms 5716 KB Output is correct
8 Correct 43 ms 8680 KB Output is correct
9 Correct 42 ms 8640 KB Output is correct
10 Correct 42 ms 8776 KB Output is correct
11 Correct 43 ms 8788 KB Output is correct
12 Correct 45 ms 8784 KB Output is correct
13 Correct 44 ms 8784 KB Output is correct
14 Correct 40 ms 8784 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 70 ms 3172 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 75 ms 3116 KB Output is correct
25 Correct 57 ms 3152 KB Output is correct
26 Correct 56 ms 3408 KB Output is correct
27 Correct 77 ms 3156 KB Output is correct
28 Correct 501 ms 3412 KB Output is correct
29 Execution timed out 4074 ms 5876 KB Time limit exceeded
30 Halted 0 ms 0 KB -