oj.uz

Submission #61790

# Submission time Handle Problem Language Result Execution time Memory
61790 2018-07-26T17:47:03 Z Benq popa (BOI18_popa) C++11
61 / 100
 411 ms 700 KB 
#include "popa.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

/*vi seq =  {12, 4, 16, 2, 2, 20};

int g(int l, int r) {
    int ret = 0;
    FOR(i,l,r+1) ret = __gcd(ret,seq[i]);
    return ret;
}

int query(int a, int b, int c, int d) {
    return g(a,b) == g(c,d);    
}*/


int solve(int L, int R, int* Left, int* Right) {
    if (L > R) return -1;
    if (L == R) {
        Left[L] = Right[L] = -1;
        return L;
    }
    int lo = L, hi = R;
    while (lo < hi) {
        int m = (lo+hi)/2;
        if (query(L,R,L,m)) hi = m;
        else lo = m+1;
    }
    //cout << L << " " << lo << " " << R << "\n";
    // exit(0);
    Left[lo] = solve(L,lo-1,Left,Right);
    Right[lo] = solve(lo+1,R,Left,Right);
    return lo;
}

int solve(int N, int* Left, int* Right) {
    return solve(0,N-1,Left,Right);
}

/*int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int* Left = new int[6];
    int* Right = new int[6];
    cout << solve(6,Left,Right) << "\n";
    F0R(i,6) cout << Left[i] << " ";
    cout << "\n";
    F0R(i,6) cout << Right[i] << " ";
    cout << "\n";
}*/

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 248 KB Output is correct
2 Correct 37 ms 308 KB Output is correct
3 Correct 12 ms 544 KB Output is correct
4 Correct 24 ms 544 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 700 KB Output is correct
2 Correct 411 ms 700 KB Output is correct
3 Correct 129 ms 700 KB Output is correct
4 Correct 200 ms 700 KB Output is correct

Subtask #3
0 / 39.0

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