oj.uz

답안 #58143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58143 2018-07-17T03:36:52 Z Benq 선물 배송 (IZhO12_train) C++14
100 / 100
 733 ms 39864 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 N,M, cur[800001];
vi ori;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M;
    set<pi> S;
    FOR(i,1,M+1) S.insert({0,-i});
    F0R(i,N) {
        int x; cin >> x; ori.pb(x);
        pi z = *prev(S.ub({x,-MOD}));
        S.erase(z);  z.s *= -1; cur[x] = z.s;
        S.insert({x,-z.s});
    }
    for (int i: ori) cout << cur[i] << " ";
    cout << "\n";
    FOR(i,1,N+1) cout << cur[i] << " ";
}

/* 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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 3 ms 536 KB Output is correct
5 Correct 3 ms 548 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 8 ms 916 KB Output is correct
8 Correct 9 ms 948 KB Output is correct
9 Correct 8 ms 1128 KB Output is correct
10 Correct 10 ms 1180 KB Output is correct
11 Correct 8 ms 1268 KB Output is correct
12 Correct 11 ms 1292 KB Output is correct
13 Correct 516 ms 21472 KB Output is correct
14 Correct 635 ms 28112 KB Output is correct
15 Correct 733 ms 35508 KB Output is correct
16 Correct 444 ms 35508 KB Output is correct
17 Correct 493 ms 36404 KB Output is correct
18 Correct 179 ms 36404 KB Output is correct
19 Correct 233 ms 36404 KB Output is correct
20 Correct 425 ms 39864 KB Output is correct