oj.uz

답안 #997587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
997587 2024-06-12T14:24:08 Z TimDee Minerals (JOI19_minerals) C++17
80 / 100
 160 ms 10976 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0; i<(n); ++i)
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second 

int query(int x) {
    return Query(x+1);
}
void Solve(int n) {

    vector<int> in(2*n), c(2*n);
    vector<int> f,s;

    int last=0;
    forn(i,2*n) {
        int z = query(i);
        if (z > last) f.pb(i);
        else s.pb(i); 
        in[i]=1;
        last = z;
    }

    forn(i,n) c[f[i]]=i;

    vector<pi> v(n);
    forn(i,n) v[i]={0,n-1};

    multiset<int> st;
    forn(i,n) st.insert(n/2);

    vector<vector<int>> ok(n);
    forn(i,n) ok[n/2].pb(i);

    set<int> alive;
    forn(i,n) alive.insert(i);

    vector<vector<int>> other(n);

    int dir = -1;
    int pos=n-1;
    int q2=0;
    while (st.size()) {
        ++q2;

        if (dir == 1) {

            for(auto&x:ok[pos]) {
                st.erase(st.find(pos));
                int l=v[x].f, r=v[x].s;
                if (l==r) continue;
                int m=(l+r+1)>>1;
                int q = query(s[x]);
                int z = -1;
                if (r-l==1) {
                    z = l;
                }
                if (in[s[x]]) {
                    if (q < last) {
                        l = m;
                    } else {
                        r = m-1;
                    }
                } else {
                    if (q > last) {
                        l = m;
                    } else {
                        r = m-1;
                    }
                }
                in[s[x]]^=1;
                last = q;
                v[x] = {l,r};
                m = (l+r+1)>>1;
                if (z!=-1) {
                    int a=other[z][0],b=other[z][1];
                    if (x==a) {
                        if (r==z) v[b]={z+1,z+1};
                        else v[b]={z,z};
                    } else {
                        if (r==z) v[a]={z+1,z+1};
                        else v[a]={z,z};
                    }
                    alive.erase(z);
                    alive.erase(z+1);
                }
                if (l!=r) {
                    ok[m].pb(x);
                    st.insert(m);
                }
                if (r-l==1) {
                    other[l].pb(x);
                }
            }
            ok[pos].clear();

            auto it = st.lower_bound(pos);
            if (it==st.end()) {
                dir*=-1;
                continue;
            }

            last = query(f[pos]);
            auto it2 = alive.upper_bound(pos);
            pos = *it2;

        } else {

            auto it3 = st.upper_bound(pos);
            if (it3!=st.end()) {
                auto it2 = alive.upper_bound(pos);
                pos = *it2;
                dir *= -1; continue;
            }

            last = query(f[pos]);

            for(auto&x:ok[pos]) {
                st.erase(st.find(pos));
                int l=v[x].f, r=v[x].s;
                if (l==r) continue;
                int m=(l+r+1)>>1;
                int q = query(s[x]);
                int z = -1;
                if (r-l==1) {
                    z = l;
                }
                if (in[s[x]]) {
                    if (q < last) {
                        l = m;
                    } else {
                        r = m-1;
                    }
                } else {
                    if (q > last) {
                        l = m;
                    } else {
                        r = m-1;
                    }
                }
                in[s[x]]^=1;
                last = q;
                v[x] = {l,r};
                m = (l+r+1)>>1;
                if (z!=-1) {
                    int a=other[z][0],b=other[z][1];
                    if (x==a) {
                        if (r==z) v[b]={z+1,z+1};
                        else v[b]={z,z};
                    } else {
                        if (r==z) v[a]={z+1,z+1};
                        else v[a]={z,z};
                    }
                    alive.erase(z);
                    alive.erase(z+1);
                }
                if (l!=r) {
                    ok[m].pb(x);
                    st.insert(m);
                }
                if (r-l==1) {
                    other[l].pb(x);
                }
            }
            ok[pos].clear();

            auto it = st.lower_bound(pos);
            if (it == st.begin()) {
                dir *= -1;
                continue;
            }

            auto it2 = alive.lower_bound(pos);
            --it2;
            pos = *it2;
        }
    }
    //cout<<"? "<<q2<<"  ";

    forn(i,n) Answer(s[i]+1,f[v[i].f]+1);

}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 5 ms 856 KB Output is correct
3 Correct 10 ms 1364 KB Output is correct
4 Correct 22 ms 2036 KB Output is correct
5 Correct 48 ms 3664 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct
8 Correct 22 ms 2036 KB Output is correct
9 Correct 48 ms 3664 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2888 KB Output is correct
12 Correct 50 ms 3920 KB Output is correct
13 Correct 44 ms 3920 KB Output is correct
14 Correct 43 ms 3672 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct
8 Correct 22 ms 2036 KB Output is correct
9 Correct 48 ms 3664 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2888 KB Output is correct
12 Correct 50 ms 3920 KB Output is correct
13 Correct 44 ms 3920 KB Output is correct
14 Correct 43 ms 3672 KB Output is correct
15 Correct 142 ms 10444 KB Output is correct
16 Correct 142 ms 10352 KB Output is correct
17 Correct 158 ms 9924 KB Output is correct
18 Correct 131 ms 9808 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct
8 Correct 22 ms 2036 KB Output is correct
9 Correct 48 ms 3664 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2888 KB Output is correct
12 Correct 50 ms 3920 KB Output is correct
13 Correct 44 ms 3920 KB Output is correct
14 Correct 43 ms 3672 KB Output is correct
15 Correct 142 ms 10444 KB Output is correct
16 Correct 142 ms 10352 KB Output is correct
17 Correct 158 ms 9924 KB Output is correct
18 Correct 131 ms 9808 KB Output is correct
19 Correct 148 ms 10696 KB Output is correct
20 Correct 151 ms 10452 KB Output is correct
21 Correct 157 ms 10268 KB Output is correct
22 Correct 132 ms 10224 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct
8 Correct 22 ms 2036 KB Output is correct
9 Correct 48 ms 3664 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2888 KB Output is correct
12 Correct 50 ms 3920 KB Output is correct
13 Correct 44 ms 3920 KB Output is correct
14 Correct 43 ms 3672 KB Output is correct
15 Correct 142 ms 10444 KB Output is correct
16 Correct 142 ms 10352 KB Output is correct
17 Correct 158 ms 9924 KB Output is correct
18 Correct 131 ms 9808 KB Output is correct
19 Correct 148 ms 10696 KB Output is correct
20 Correct 151 ms 10452 KB Output is correct
21 Correct 157 ms 10268 KB Output is correct
22 Correct 132 ms 10224 KB Output is correct
23 Correct 151 ms 10832 KB Output is correct
24 Correct 158 ms 10724 KB Output is correct
25 Correct 160 ms 10576 KB Output is correct
26 Correct 140 ms 10320 KB Output is correct

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct
8 Correct 22 ms 2036 KB Output is correct
9 Correct 48 ms 3664 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2888 KB Output is correct
12 Correct 50 ms 3920 KB Output is correct
13 Correct 44 ms 3920 KB Output is correct
14 Correct 43 ms 3672 KB Output is correct
15 Correct 142 ms 10444 KB Output is correct
16 Correct 142 ms 10352 KB Output is correct
17 Correct 158 ms 9924 KB Output is correct
18 Correct 131 ms 9808 KB Output is correct
19 Correct 148 ms 10696 KB Output is correct
20 Correct 151 ms 10452 KB Output is correct
21 Correct 157 ms 10268 KB Output is correct
22 Correct 132 ms 10224 KB Output is correct
23 Correct 151 ms 10832 KB Output is correct
24 Correct 158 ms 10724 KB Output is correct
25 Correct 160 ms 10576 KB Output is correct
26 Correct 140 ms 10320 KB Output is correct
27 Incorrect 159 ms 10976 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct
8 Correct 22 ms 2036 KB Output is correct
9 Correct 48 ms 3664 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2888 KB Output is correct
12 Correct 50 ms 3920 KB Output is correct
13 Correct 44 ms 3920 KB Output is correct
14 Correct 43 ms 3672 KB Output is correct
15 Correct 142 ms 10444 KB Output is correct
16 Correct 142 ms 10352 KB Output is correct
17 Correct 158 ms 9924 KB Output is correct
18 Correct 131 ms 9808 KB Output is correct
19 Correct 148 ms 10696 KB Output is correct
20 Correct 151 ms 10452 KB Output is correct
21 Correct 157 ms 10268 KB Output is correct
22 Correct 132 ms 10224 KB Output is correct
23 Correct 151 ms 10832 KB Output is correct
24 Correct 158 ms 10724 KB Output is correct
25 Correct 160 ms 10576 KB Output is correct
26 Correct 140 ms 10320 KB Output is correct
27 Incorrect 159 ms 10976 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct
8 Correct 22 ms 2036 KB Output is correct
9 Correct 48 ms 3664 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2888 KB Output is correct
12 Correct 50 ms 3920 KB Output is correct
13 Correct 44 ms 3920 KB Output is correct
14 Correct 43 ms 3672 KB Output is correct
15 Correct 142 ms 10444 KB Output is correct
16 Correct 142 ms 10352 KB Output is correct
17 Correct 158 ms 9924 KB Output is correct
18 Correct 131 ms 9808 KB Output is correct
19 Correct 148 ms 10696 KB Output is correct
20 Correct 151 ms 10452 KB Output is correct
21 Correct 157 ms 10268 KB Output is correct
22 Correct 132 ms 10224 KB Output is correct
23 Correct 151 ms 10832 KB Output is correct
24 Correct 158 ms 10724 KB Output is correct
25 Correct 160 ms 10576 KB Output is correct
26 Correct 140 ms 10320 KB Output is correct
27 Incorrect 159 ms 10976 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -