oj.uz

Submission #94818

# Submission time Handle Problem Language Result Execution time Memory
94818 2019-01-24T08:53:24 Z popovicirobert popa (BOI18_popa) C++14
61 / 100
 135 ms 504 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44
#include <popa.h>


using namespace std;



const int MAXN = 1000;

int l[MAXN + 1], r[MAXN + 1];
int stk[MAXN + 1];

/*int query(int a, int b, int c, int d) {
    cout << 0 << " " << a << " " << b << " " << c << " " << d << "\n";
    int ans;
    cin >> ans;
    return ans;

}*/

int solve(int n, int *l, int *r) {
    int i;
    for(i = 0; i < n; i++) {
        l[i] = r[i] = -1;
    }
    int sz = 0;
    for(i = 0; i < n; i++) {
        while(sz > 1 && query(i, i, stk[sz - 1], i)) {
            r[stk[sz - 1]] = stk[sz];
            sz--;
        }
        while(sz > 0 && query(i, i, stk[sz], i)) {
            l[i] = stk[sz];
            sz--;
        }
        stk[++sz] = i;
    }
    while(sz > 1) {
        r[stk[sz - 1]] = stk[sz];
        sz--;
    }
    return stk[1];
}

/*int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, t;
    ios::sync_with_stdio(false);
    //cin.tie(0), cout.tie(0);
    /cin >> t;
    while(t > 0) {
        t--;
        int n;
        cin >> n;
        solve(n);
        cout << 1 << "\n" << stk[1] << "\n";
        for(i = 0; i < n; i++) {
            cout << l[i] << " ";
        }
        cout << "\n";
        for(i = 0; i < n; i++) {
            cout << r[i] << " ";
        }
        cout << "\n";
    }
    //cin.close();
    //cout.close();
    return 0;
}*/

Subtask #1
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 252 KB Output is correct
2 Correct 14 ms 376 KB Output is correct
3 Correct 18 ms 504 KB Output is correct
4 Correct 6 ms 376 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 456 KB Output is correct
2 Correct 135 ms 332 KB Output is correct
3 Correct 86 ms 376 KB Output is correct
4 Correct 110 ms 328 KB Output is correct

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 248 KB too many queries
2 Halted 0 ms 0 KB -