oj.uz

Submission #640354

# Submission time Handle Problem Language Result Execution time Memory
640354 2022-09-14T10:15:40 Z lis05st Comparing Plants (IOI20_plants) C++17
5 / 100
 73 ms 7920 KB 
#ifdef LIS05ST
    #define _GLIBCXX_DEBUG
    #define _GLIBCXX_DEBUG_PEDANTIC
#endif
#pragma GCC optimize("O3")
#pragma GCC target("avx2,popcnt,lzcnt")
#include"plants.h"
#include"bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;

const int NMAX=2e5;
int pref[NMAX+5];
int n;

int get(int l,int r){
    return pref[r]-pref[l-1];
}
bool one(int l,int r){
    return get(l,r)==r-l+1;
}
bool zero(int l,int r){
    return get(l,r)==0;
}
void init(int k, std::vector<int> r){
    n=r.size();
    for(int i=0;i<n;i++)pref[i+1]=pref[i]+r[i];
};
int compare_plants(int x, int y){
    x++,y++;
    if(zero(x,y-1))return 1;
    if(one(1,x-1)&&one(y,n))return 1;
    if(one(x,y-1))return -1;
    if(zero(1,x-1)&&zero(y,n))return -1;
    return 0;
}

#define MULTITESTS false
void solve(int testCase){

}

           
//   x     y


void precalc(){

}
/*
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    precalc();
    int t=1;
    if(MULTITESTS)cin>>t;
    for(int i=1;i<=t;i++){
        auto t1=clock();
        solve(i);
        auto t2=clock();
        float delta=t2-t1;
        delta/=CLOCKS_PER_SEC;
        #ifdef LIS05ST
        cout<<"("<<i<<")------------"<<fixed<<setprecision(2)<<delta<<"s\n";
        #endif
    }
}*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 304 KB Output is correct
6 Correct 47 ms 4060 KB Output is correct
7 Correct 51 ms 5436 KB Output is correct
8 Correct 73 ms 7912 KB Output is correct
9 Correct 72 ms 7872 KB Output is correct
10 Correct 66 ms 7912 KB Output is correct
11 Correct 67 ms 7892 KB Output is correct
12 Correct 66 ms 7920 KB Output is correct
13 Correct 63 ms 7916 KB Output is correct
14 Correct 65 ms 7916 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 304 KB Output is correct
6 Correct 47 ms 4060 KB Output is correct
7 Correct 51 ms 5436 KB Output is correct
8 Correct 73 ms 7912 KB Output is correct
9 Correct 72 ms 7872 KB Output is correct
10 Correct 66 ms 7912 KB Output is correct
11 Correct 67 ms 7892 KB Output is correct
12 Correct 66 ms 7920 KB Output is correct
13 Correct 63 ms 7916 KB Output is correct
14 Correct 65 ms 7916 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -