Submission #779394

# Submission time Handle Problem Language Result Execution time Memory
779394 2023-07-11T11:31:57 Z jasmin Comparing Plants (IOI20_plants) C++17
0 / 100
1 ms 296 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;
        }
        else if(ssum==0){
            return 1;
        }
        else{
            return 0;
        }

    }
    else{

        int ssum = ps[x] - ps[y];
        if(ssum == x-y){
            return 1;
        }
        else if(ssum==0){
            return -1;
        }
        else{
            return 0;
        }
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 220 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 220 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 296 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -