oj.uz

Submission #377582

# Submission time Handle Problem Language Result Execution time Memory
377582 2021-03-14T10:29:04 Z marat0210 Comparing Plants (IOI20_plants) C++14
5 / 100
 114 ms 8292 KB 
#include <plants.h>
#include <bits/stdc++.h>

using namespace std;

vector <int> s;
int n;

void init(int k, vector <int> r)
{
    n = r.size();
    s.push_back(0);
    for (int i: r) {
        s.push_back(s.back() + i);
    }
}

int compare_plants(int x, int y)
{
    if (x > y) return -compare_plants(y, x);
    if (s[x] == s[y]) return 1;
    if (s[y] == s[n] and s[0] == s[x]) return -1;
    if (s[x] - x == s[y] - y) return -1;
    if (s[y] - y == s[n] - n and s[0] == s[x] - x) return 1;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 60 ms 4076 KB Output is correct
7 Correct 77 ms 5556 KB Output is correct
8 Correct 97 ms 8292 KB Output is correct
9 Correct 92 ms 7524 KB Output is correct
10 Correct 93 ms 6884 KB Output is correct
11 Correct 93 ms 7652 KB Output is correct
12 Correct 114 ms 6884 KB Output is correct
13 Correct 96 ms 8292 KB Output is correct
14 Correct 87 ms 6884 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 60 ms 4076 KB Output is correct
7 Correct 77 ms 5556 KB Output is correct
8 Correct 97 ms 8292 KB Output is correct
9 Correct 92 ms 7524 KB Output is correct
10 Correct 93 ms 6884 KB Output is correct
11 Correct 93 ms 7652 KB Output is correct
12 Correct 114 ms 6884 KB Output is correct
13 Correct 96 ms 8292 KB Output is correct
14 Correct 87 ms 6884 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Incorrect 1 ms 364 KB Output isn't correct
18 Halted 0 ms 0 KB -