Submission #431091

# Submission time Handle Problem Language Result Execution time Memory
431091 2021-06-17T09:27:04 Z MOUF_MAHMALAT Comparing Plants (IOI20_plants) C++14
0 / 100
0 ms 204 KB
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
vector<ll>v;
ll k,a[200009],n;
void init(int K, vector<int> r)
{
    v=r,n=v.size();
    for(ll i=0; i<n; i++)
    {
        if(v[i])
            a[(i+1)%n]=a[i]-1;
        else
            a[(i+1)%n]=a[i]+1;
    }
}

int compare_plants(int x, int y)
{
    if(a[x]==a[y])
        return 0;
    if(a[x]>a[y])
        return 1;
    return -1;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -