oj.uz

Submission #1106643

# Submission time Handle Problem Language Result Execution time Memory
1106643 2024-10-30T18:30:38 Z Ahmed57 Sphinx's Riddle (IOI24_sphinx) C++17
10 / 100
 380 ms 1436 KB 
#include <bits/stdc++.h>
#include "sphinx.h"
 
using namespace std;
int pr2[251];
int find2(int x){
    if(x==pr2[x])return x;
    return pr2[x] = find2(pr2[x]);  
}
void mergegroup2(int a,int b){
    a = find2(a);
    b = find2(b);
    if(a==b)return ;
    pr2[a] = b;
}
int pr[251];
vector<int> adjj[251],nadj[251];
int find(int x){
    if(x==pr[x])return x;
    return pr[x] = find(pr[x]);
}
bool mergegroup(int a,int b){
    a = find(a);
    b = find(b);
    if(a==b)return 0;
    pr[a] = b;
    return 1;
}
vector<int> even,odd;
int VIS[251];
void dfs(int i,int dep){
    VIS[i] =1 ;
    if(dep)even.push_back(i);
    else odd.push_back(i);
    for(auto j:adjj[i]){
        if(!VIS[j])dfs(j,dep^1);
    }
}
vector<int> find_colours(int n,vector<int> X,vector<int> Y){
    for(int i = 0;i<X.size();i++){
        adjj[X[i]].push_back(Y[i]);
        adjj[Y[i]].push_back(X[i]);
    }
    int d = 0;
    for(int i = 0;i<n;i++){
        pr2[i] = i;
    }
    for(int i = n-1;i>=0;i--){
        int ans = 0;
        while(ans!=-1){
        vector<int> v;
        int vis[n] = {0};
        for(auto j:adjj[i]){
            if(j>i&&vis[find2(j)]==0&&find2(j)!=find2(i)){
                v.push_back(j);
                vis[find2(j)] = 1;
            }
        }
        int sz = v.size();
        int l = 0 , r = sz-1;
        ans = -1;
        while(l<=r){
            int mid = (l+r)/2;
            vector<int> e(n,n);
            e[i] = -1;
            for(int j = 0;j<=mid;j++){
                e[v[j]] = -1;
            }
            int cnt = 0;
            for(int j = 0;j<n;j++){
                if(e[j]==-1){
                    pr[j] = j;cnt++;
                }else {
                    pr[j] = j;cnt++;
                }
            }
            for(int j = 0;j<X.size();j++){
                if(e[X[j]]==-1&&e[Y[j]]==-1){
                    if(X[j]==i||Y[j]==i)continue;
                    if(find2(X[j])==find2(Y[j]))cnt-=mergegroup(X[j],Y[j]);
                }else if(e[X[j]]==n&&e[Y[j]]==n){
                    cnt-=mergegroup(X[j],Y[j]);
                }
            }
            if(cnt==perform_experiment(e)){
                l = mid+1;
            }else {
                ans = mid;
                r = mid-1;
            }
        }
        if(ans!=-1){
            mergegroup2(i,v[ans]);
        }
        }
    }
    vector<int> V[n];
    for(int i = 0;i<n;i++){
        V[find2(i)].push_back(i);
    }
    for(int i = 0;i<X.size();i++){
        if(find2(X[i])!=find2(Y[i])){
            nadj[find2(X[i])].push_back(find2(Y[i]));
            nadj[find2(Y[i])].push_back(find2(X[i]));
        }
    }
    dfs(0,0);
    int in[n] = {0};
    for(int i = 0;i<n;i++){
        {
            vector<int> lol;
            for(auto j:even){
                if(in[j]==0){
                    lol.push_back(j);
                }
            }
            int ans = 0;
            while(ans!=-1){
                int sz = lol.size();
                int l = ans , r = sz-1;
                int org = ans;
                ans = -1;
                while(l<=r){
                    int mid = (l+r)/2;
                    vector<int> e(n,i);
                    int cnt = 0;
                    for(int j = 0;j<n;j++){
                        if(e[j]==-1){
                            pr[j] = j;cnt++;
                        }else {
                            pr[j] = j;cnt++;
                        }
                    }
                    for(int j = org;j<=mid;j++){
                        e[lol[j]] = -1;
                    }
                    for(int j = 0;j<X.size();j++){
                        if(e[X[j]]==-1&&e[Y[j]]==-1){
                            if(find2(X[j])==find2(Y[j]))cnt-=mergegroup(X[j],Y[j]);
                        }else if(e[X[j]]==i&&e[Y[j]]==i){
                            cnt-=mergegroup(X[j],Y[j]);
                        }
                    }
                    if(cnt==perform_experiment(e)){
                        l = mid+1;
                    }else {
                        ans = mid;
                        r = mid-1;
                    }
                }
                if(ans==-1){
                    break;
                }
                in[lol[ans]] = i+1;
                ans++;
            }
        }
        swap(even,odd);
        {
            vector<int> lol;
            for(auto j:even){
                if(in[j]==0){
                    lol.push_back(j);
                }
            }
            int ans = 0;
            while(ans!=-1){
                int sz = lol.size();
                int l = ans , r = sz-1;
                int org = ans;
                ans = -1;
                while(l<=r){
                    int mid = (l+r)/2;
                    vector<int> e(n,i);
                    int cnt = 0;
                    for(int j = 0;j<n;j++){
                        if(e[j]==-1){
                            pr[j] = j;cnt++;
                        }else {
                            pr[j] = j;cnt++;
                        }
                    }
                    for(int j = org;j<=mid;j++){
                        e[lol[j]] = -1;
                    }
                    for(int j = 0;j<X.size();j++){
                        if(e[X[j]]==-1&&e[Y[j]]==-1){
                            if(find2(X[j])==find2(Y[j]))cnt-=mergegroup(X[j],Y[j]);
                        }else if(e[X[j]]==i&&e[Y[j]]==i){
                            cnt-=mergegroup(X[j],Y[j]);
                        }
                    }
                    if(cnt==perform_experiment(e)){
                        l = mid+1;
                    }else {
                        ans = mid;
                        r = mid-1;
                    }
                }
                if(ans==-1){
                    break;
                }
                in[lol[ans]] = i+1;
                ans++;
            }
        }
    }
    vector<int> col(n,0);
    for(int i = 0;i<n;i++){
        col[i] = in[i]-1;
    }
    return col;
}

Compilation message

sphinx.cpp: In function 'std::vector<int> find_colours(int, std::vector<int>, std::vector<int>)':
sphinx.cpp:40:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i = 0;i<X.size();i++){
      |                   ~^~~~~~~~~
sphinx.cpp:77:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             for(int j = 0;j<X.size();j++){
      |                           ~^~~~~~~~~
sphinx.cpp:101:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for(int i = 0;i<X.size();i++){
      |                   ~^~~~~~~~~
sphinx.cpp:137:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |                     for(int j = 0;j<X.size();j++){
      |                                   ~^~~~~~~~~
sphinx.cpp:186:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  186 |                     for(int j = 0;j<X.size();j++){
      |                                   ~^~~~~~~~~
sphinx.cpp:44:9: warning: unused variable 'd' [-Wunused-variable]
   44 |     int d = 0;
      |         ^

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 9

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 3
2 Correct 1 ms 336 KB #experiments: 4
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 336 KB #experiments: 5

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 9
2 Correct 1 ms 336 KB #experiments: 3
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 336 KB #experiments: 4
5 Correct 1 ms 336 KB #experiments: 5
6 Correct 6 ms 336 KB #experiments: 445
7 Correct 7 ms 336 KB #experiments: 504
8 Correct 7 ms 336 KB #experiments: 595
9 Correct 7 ms 504 KB #experiments: 527
10 Correct 5 ms 336 KB #experiments: 462
11 Correct 6 ms 336 KB #experiments: 491
12 Correct 5 ms 336 KB #experiments: 526
13 Correct 5 ms 336 KB #experiments: 540
14 Correct 6 ms 336 KB #experiments: 345
15 Correct 11 ms 508 KB #experiments: 657
16 Correct 19 ms 500 KB #experiments: 753
17 Correct 16 ms 336 KB #experiments: 791
18 Correct 14 ms 508 KB #experiments: 853
19 Correct 13 ms 496 KB #experiments: 801
20 Correct 18 ms 492 KB #experiments: 797
21 Correct 11 ms 336 KB #experiments: 729
22 Correct 5 ms 336 KB #experiments: 338
23 Correct 5 ms 336 KB #experiments: 330
24 Correct 5 ms 336 KB #experiments: 359
25 Correct 8 ms 472 KB #experiments: 481
26 Correct 6 ms 336 KB #experiments: 480
27 Correct 6 ms 336 KB #experiments: 507
28 Correct 8 ms 336 KB #experiments: 528
29 Correct 8 ms 336 KB #experiments: 624
30 Correct 10 ms 336 KB #experiments: 659
31 Correct 13 ms 336 KB #experiments: 790
32 Correct 15 ms 592 KB #experiments: 812
33 Correct 6 ms 336 KB #experiments: 491
34 Correct 12 ms 492 KB #experiments: 704

Subtask #3
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 3
2 Correct 1 ms 336 KB #experiments: 4
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 336 KB #experiments: 5
5 Correct 6 ms 336 KB #experiments: 445
6 Correct 7 ms 336 KB #experiments: 504
7 Correct 7 ms 336 KB #experiments: 595
8 Correct 7 ms 504 KB #experiments: 527
9 Correct 5 ms 336 KB #experiments: 462
10 Correct 6 ms 336 KB #experiments: 491
11 Correct 5 ms 336 KB #experiments: 526
12 Correct 5 ms 336 KB #experiments: 540
13 Incorrect 53 ms 336 KB #experiments reached 2751
14 Halted 0 ms 0 KB -

Subtask #4
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 3
2 Correct 1 ms 336 KB #experiments: 4
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 336 KB #experiments: 5
5 Correct 6 ms 336 KB #experiments: 345
6 Correct 11 ms 508 KB #experiments: 657
7 Correct 19 ms 500 KB #experiments: 753
8 Correct 16 ms 336 KB #experiments: 791
9 Correct 14 ms 508 KB #experiments: 853
10 Correct 13 ms 496 KB #experiments: 801
11 Correct 18 ms 492 KB #experiments: 797
12 Correct 11 ms 336 KB #experiments: 729
13 Incorrect 380 ms 1436 KB #experiments reached 2751
14 Halted 0 ms 0 KB -

Subtask #5
0.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 9
2 Correct 1 ms 336 KB #experiments: 3
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 336 KB #experiments: 4
5 Correct 1 ms 336 KB #experiments: 5
6 Correct 6 ms 336 KB #experiments: 445
7 Correct 7 ms 336 KB #experiments: 504
8 Correct 7 ms 336 KB #experiments: 595
9 Correct 7 ms 504 KB #experiments: 527
10 Correct 5 ms 336 KB #experiments: 462
11 Correct 6 ms 336 KB #experiments: 491
12 Correct 5 ms 336 KB #experiments: 526
13 Correct 5 ms 336 KB #experiments: 540
14 Correct 6 ms 336 KB #experiments: 345
15 Correct 11 ms 508 KB #experiments: 657
16 Correct 19 ms 500 KB #experiments: 753
17 Correct 16 ms 336 KB #experiments: 791
18 Correct 14 ms 508 KB #experiments: 853
19 Correct 13 ms 496 KB #experiments: 801
20 Correct 18 ms 492 KB #experiments: 797
21 Correct 11 ms 336 KB #experiments: 729
22 Correct 5 ms 336 KB #experiments: 338
23 Correct 5 ms 336 KB #experiments: 330
24 Correct 5 ms 336 KB #experiments: 359
25 Correct 8 ms 472 KB #experiments: 481
26 Correct 6 ms 336 KB #experiments: 480
27 Correct 6 ms 336 KB #experiments: 507
28 Correct 8 ms 336 KB #experiments: 528
29 Correct 8 ms 336 KB #experiments: 624
30 Correct 10 ms 336 KB #experiments: 659
31 Correct 13 ms 336 KB #experiments: 790
32 Correct 15 ms 592 KB #experiments: 812
33 Correct 6 ms 336 KB #experiments: 491
34 Correct 12 ms 492 KB #experiments: 704
35 Incorrect 53 ms 336 KB #experiments reached 2751
36 Halted 0 ms 0 KB -