oj.uz

답안 #58915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58915 2018-07-19T19:50:10 Z Benq CATS (NOI14_cats) C++14
8 / 25
 1500 ms 2052 KB 
#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;

int Q;

ll solve() {
    ll X,L,N; cin >> X >> L >> N;
    int cflip = 0;
    vi cur;
    while (1) {
        int f;
        if (sz(cur)) f = cur.back(), cur.pop_back();
        else f = cflip; 
        cflip ^= 1; for (int& i: cur) i ^= 1;
        
        if (f > L) {
            X --;
            if (X == 0) return f;
        } else {
            cur.pb(2*N+f);
            cur.pb(2*N+f);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> Q;
    F0R(i,Q) cout << solve() << "\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
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 10 ms 596 KB Output is correct
3 Correct 8 ms 596 KB Output is correct
4 Correct 7 ms 596 KB Output is correct
5 Correct 7 ms 724 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 373 ms 900 KB Output is correct
2 Correct 166 ms 1024 KB Output is correct

Subtask #3
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1556 ms 1024 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1568 ms 1080 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1580 ms 2052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1576 ms 2052 KB Time limit exceeded
2 Halted 0 ms 0 KB -