oj.uz

Submission #1084478

# Submission time Handle Problem Language Result Execution time Memory
1084478 2024-09-06T09:50:29 Z vjudge1 Comparing Plants (IOI20_plants) C++17
5 / 100
 65 ms 4952 KB 
#include<bits/stdc++.h>
#include "plants.h"
using namespace std;
int n, cd[200005];
void init(int k, vector<int> r)
{
    n = r.size();
    for(int i = 0; i < n; i++) cd[i+1] = cd[i] + r[i];
}
int compare_plants(int x, int y)
{
    x++; y++;
    if(cd[y-1] - cd[x-1] == 0 || cd[n]-(cd[y-1]-cd[x-1]) == n-y+x) return 1;
    else if(cd[y-1] - cd[x-1] == y-x || cd[n]-(cd[y-1]-cd[x-1]) == 0) return -1;
    else return 0;
}
/*int main()
{
    int n, k, q;
    cin>>n>>k>>q;
    vector<int> r(n);
    for(int i = 0; i < n; i++) cin>>r[i];
    init(k, r);
    for(int i = 1; i <= q; i++){
        int x, y;
        cin>>x>>y;
        cout<<compare_plants(x, y)<<'\n';
    }
}
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 43 ms 3068 KB Output is correct
7 Correct 34 ms 3412 KB Output is correct
8 Correct 46 ms 4944 KB Output is correct
9 Correct 46 ms 4952 KB Output is correct
10 Correct 48 ms 4944 KB Output is correct
11 Correct 56 ms 4948 KB Output is correct
12 Correct 46 ms 4948 KB Output is correct
13 Correct 65 ms 4944 KB Output is correct
14 Correct 45 ms 4944 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 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 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

# Verdict Execution time Memory 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Correct 1 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 43 ms 3068 KB Output is correct
7 Correct 34 ms 3412 KB Output is correct
8 Correct 46 ms 4944 KB Output is correct
9 Correct 46 ms 4952 KB Output is correct
10 Correct 48 ms 4944 KB Output is correct
11 Correct 56 ms 4948 KB Output is correct
12 Correct 46 ms 4948 KB Output is correct
13 Correct 65 ms 4944 KB Output is correct
14 Correct 45 ms 4944 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -