oj.uz

답안 #944787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944787 2024-03-13T04:49:34 Z yeediot Minerals (JOI19_minerals) C++14
80 / 100
 37 ms 3780 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
const int mxn=43000;
 
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
set<int>cur;
int color[mxn];
int cnt[mxn];
int n;
bool ok;
int tt=0;
void init(){
    cin>>n;
    for(int i=1;i<=2*n;i++){
        cin>>color[i];
    }
}
int res;
int Query(int x){
    tt++;
    if(cur.find(x)!=cur.end()){
        cur.erase(x);
        cnt[color[x]]--;
        if(cnt[color[x]]==0)res--;
    }
    else{
        cur.insert(x);
        cnt[color[x]]++;
        if(cnt[color[x]]==1)res++;
    }
    return res;
}
void Answer(int a,int b){
    if(a>b)swap(a,b);
    cout<<a<<' '<<b<<'\n';
    if(color[a]!=color[b]){
        ok=0;
    }
}
#else
void setio(){}
#include "minerals.h"
#endif
//////////////////
vector<int>cur2;
void Solve(int n){
    vector<int>temp;
    int prev=0;
    vector<int>ord(2*n);
    for(int i=1;i<=2*n;i++){
        ord[i-1]=i;
    }
    mt19937_64 rng(time(NULL));
    shuffle(all(ord),rng);
    for(int i=2*n;i>=1;i--){
        int x=ord[i-1];
        if(prev<=n and Query(x)==prev+1){
            prev++;
            temp.pb(x);
        }
        else{
            cur2.pb(x);
        }
    }
    queue<tuple<vector<int>,int,int,bool>>Q;
    Q.push({temp,0,n-1,1});
    while(sz(Q)){
        auto [cur,l,r,flag2]=Q.front();
        Q.pop();
        if(l==r){
            Answer(cur[0],cur2[l]);
            continue;
        }
        int mm;
        int len=(r-l)*0.34;
        if(flag2){
            mm=max(l,min(r-1,r-len));
        }
        else{
            mm=min(r-1,max(l,l+len));
        }
        int dick;
        if(flag2){
            for(int i=mm+1;i<=r;i++){
                dick=Query(cur2[i]);
            }
        }
        else{
            for(int i=l;i<=mm;i++){
                dick=Query(cur2[i]);
            }
        }
        vector<int>L,R;
        for(auto i:cur){
            int x=Query(i);
            if(x==dick){
                L.pb(i);
            }
            else{
                R.pb(i);
            }
            dick=x;
        }
        if(sz(L)){
            Q.push({L,l,mm,1});
        }
        if(sz(R)){
            Q.push({R,mm+1,r,0});
        }
    }
}
#ifdef local
int main(){
    ok=1;
    tt=0;
    setio();
    init();
    Solve(n);
    cout<<tt<<'\n';
    if(ok)cout<<"Accepted!\n";
    else cout<<"Wrong Answer\n";
}
#else
 
#endif
 
 /*
 input:
 ///////////////
 ///////
 //
     /
 /
  / 
 */

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:80:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   80 |         auto [cur,l,r,flag2]=Q.front();
      |              ^
minerals.cpp:108:13: warning: 'dick' may be used uninitialized in this function [-Wmaybe-uninitialized]
  108 |             if(x==dick){
      |             ^~

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 0 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 1 ms 344 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 11 ms 1616 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 11 ms 1616 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1112 KB Output is correct
12 Correct 10 ms 1572 KB Output is correct
13 Correct 11 ms 1568 KB Output is correct
14 Correct 11 ms 1512 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 11 ms 1616 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1112 KB Output is correct
12 Correct 10 ms 1572 KB Output is correct
13 Correct 11 ms 1568 KB Output is correct
14 Correct 11 ms 1512 KB Output is correct
15 Correct 30 ms 3424 KB Output is correct
16 Correct 33 ms 3372 KB Output is correct
17 Correct 34 ms 3380 KB Output is correct
18 Correct 28 ms 3416 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 11 ms 1616 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1112 KB Output is correct
12 Correct 10 ms 1572 KB Output is correct
13 Correct 11 ms 1568 KB Output is correct
14 Correct 11 ms 1512 KB Output is correct
15 Correct 30 ms 3424 KB Output is correct
16 Correct 33 ms 3372 KB Output is correct
17 Correct 34 ms 3380 KB Output is correct
18 Correct 28 ms 3416 KB Output is correct
19 Correct 30 ms 3496 KB Output is correct
20 Correct 31 ms 3372 KB Output is correct
21 Correct 33 ms 3676 KB Output is correct
22 Correct 28 ms 3780 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 11 ms 1616 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1112 KB Output is correct
12 Correct 10 ms 1572 KB Output is correct
13 Correct 11 ms 1568 KB Output is correct
14 Correct 11 ms 1512 KB Output is correct
15 Correct 30 ms 3424 KB Output is correct
16 Correct 33 ms 3372 KB Output is correct
17 Correct 34 ms 3380 KB Output is correct
18 Correct 28 ms 3416 KB Output is correct
19 Correct 30 ms 3496 KB Output is correct
20 Correct 31 ms 3372 KB Output is correct
21 Correct 33 ms 3676 KB Output is correct
22 Correct 28 ms 3780 KB Output is correct
23 Correct 37 ms 3496 KB Output is correct
24 Correct 33 ms 3564 KB Output is correct
25 Correct 30 ms 3636 KB Output is correct
26 Correct 29 ms 3604 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 11 ms 1616 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1112 KB Output is correct
12 Correct 10 ms 1572 KB Output is correct
13 Correct 11 ms 1568 KB Output is correct
14 Correct 11 ms 1512 KB Output is correct
15 Correct 30 ms 3424 KB Output is correct
16 Correct 33 ms 3372 KB Output is correct
17 Correct 34 ms 3380 KB Output is correct
18 Correct 28 ms 3416 KB Output is correct
19 Correct 30 ms 3496 KB Output is correct
20 Correct 31 ms 3372 KB Output is correct
21 Correct 33 ms 3676 KB Output is correct
22 Correct 28 ms 3780 KB Output is correct
23 Correct 37 ms 3496 KB Output is correct
24 Correct 33 ms 3564 KB Output is correct
25 Correct 30 ms 3636 KB Output is correct
26 Correct 29 ms 3604 KB Output is correct
27 Incorrect 32 ms 3676 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 11 ms 1616 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1112 KB Output is correct
12 Correct 10 ms 1572 KB Output is correct
13 Correct 11 ms 1568 KB Output is correct
14 Correct 11 ms 1512 KB Output is correct
15 Correct 30 ms 3424 KB Output is correct
16 Correct 33 ms 3372 KB Output is correct
17 Correct 34 ms 3380 KB Output is correct
18 Correct 28 ms 3416 KB Output is correct
19 Correct 30 ms 3496 KB Output is correct
20 Correct 31 ms 3372 KB Output is correct
21 Correct 33 ms 3676 KB Output is correct
22 Correct 28 ms 3780 KB Output is correct
23 Correct 37 ms 3496 KB Output is correct
24 Correct 33 ms 3564 KB Output is correct
25 Correct 30 ms 3636 KB Output is correct
26 Correct 29 ms 3604 KB Output is correct
27 Incorrect 32 ms 3676 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 11 ms 1616 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1112 KB Output is correct
12 Correct 10 ms 1572 KB Output is correct
13 Correct 11 ms 1568 KB Output is correct
14 Correct 11 ms 1512 KB Output is correct
15 Correct 30 ms 3424 KB Output is correct
16 Correct 33 ms 3372 KB Output is correct
17 Correct 34 ms 3380 KB Output is correct
18 Correct 28 ms 3416 KB Output is correct
19 Correct 30 ms 3496 KB Output is correct
20 Correct 31 ms 3372 KB Output is correct
21 Correct 33 ms 3676 KB Output is correct
22 Correct 28 ms 3780 KB Output is correct
23 Correct 37 ms 3496 KB Output is correct
24 Correct 33 ms 3564 KB Output is correct
25 Correct 30 ms 3636 KB Output is correct
26 Correct 29 ms 3604 KB Output is correct
27 Incorrect 32 ms 3676 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -