oj.uz

Submission #779398

# Submission time Handle Problem Language Result Execution time Memory
779398 2023-07-11T11:33:29 Z jasmin Comparing Plants (IOI20_plants) C++14
0 / 100
 1 ms 212 KB 
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> ps; //anzahl kleiner zeichen

void init(int k, std::vector<int> r) {
    int n=r.size();

    ps.assign(n+1, 0);
    for(int i=0; i<n; i++){
        ps[i+1] = ps[i] + r[i];
    }
}

int compare_plants(int x, int y) {
	
    if(x<y){

        int ssum = ps[y] - ps[x];
        if(ssum == y-x){
            return -1;
        }
        return 0;

    }
    else{

        int ssum = ps[x] - ps[y];
        if(ssum == x-y){
            return 1;
        }
        return 0;
    }
    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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