oj.uz

Submission #304586

# Submission time Handle Problem Language Result Execution time Memory
304586 2020-09-21T14:38:17 Z SorahISA Comparing Plants (IOI20_plants) C++17
0 / 100
 4000 ms 6524 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

int n;
vector<pii> ans;

void init(int k, vector<int> r) {
    n = r.size();
    
    int ltok = 0, rtok = 0;
    for (int i = 0; i < n; ++i) {
        if (r[(i-1+n)%n] == 0) ltok = i;
        if (i > rtok) ltok = rtok = i;
        while (r[rtok]         == 0) rtok = (rtok + 1) % n;
        while (r[(ltok-1+n)%n] == 1) ltok = (ltok - 1 + n) % n;
        if (ltok == rtok and ltok != i) ans.eb(ltok, rtok + n);
        else ans.eb(ltok, rtok < ltok ? rtok + n : rtok);
        // cout << ltok << " " << rtok << "\n";
    }
    
    /*
    cout << "ans test\n";
    for (auto [x, y] : ans) {
        cout << " -> " << x << " " << y << "\n";
    }
    */
    
    return;
}

int compare_plants(int x, int y) {
    if (ans[x].X <= y   and y   <= ans[x].Y) return 1;
    if (ans[x].X <= y+n and y+n <= ans[x].Y) return 1;
    if (ans[y].X <= x   and x   <= ans[y].Y) return -1;
    if (ans[y].X <= x+n and x+n <= ans[y].Y) return -1;
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 81 ms 3320 KB Output is correct
7 Correct 91 ms 3700 KB Output is correct
8 Correct 115 ms 6508 KB Output is correct
9 Correct 176 ms 6380 KB Output is correct
10 Correct 723 ms 6380 KB Output is correct
11 Correct 3671 ms 6524 KB Output is correct
12 Execution timed out 4094 ms 4980 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 81 ms 3320 KB Output is correct
7 Correct 91 ms 3700 KB Output is correct
8 Correct 115 ms 6508 KB Output is correct
9 Correct 176 ms 6380 KB Output is correct
10 Correct 723 ms 6380 KB Output is correct
11 Correct 3671 ms 6524 KB Output is correct
12 Execution timed out 4094 ms 4980 KB Time limit exceeded
13 Halted 0 ms 0 KB -