oj.uz

Submission #702865

# Submission time Handle Problem Language Result Execution time Memory
702865 2023-02-25T09:12:34 Z salmon popa (BOI18_popa) C++14
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
#include "popa.h"
using namespace std;

int solve(int N, int* Left, int* Right){

    for(int i = 0; i < N; i++){
        Left[i] = -1;
        Right[i] = -1;
    }
    return 0;

    /*int big = 0;

    for(int i = 0; i < N - 1; i++){
        if(query(i, i + 1, i + 1, i + 1) == 1){
            Left[i + 1] = big;
            big = i + 1;
        }
        else{
            Right[i] = i + 1;
            big = i;
        }
    }

    return big;*/
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 336 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 288 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 292 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -