oj.uz

Submission #1047343

# Submission time Handle Problem Language Result Execution time Memory
1047343 2024-08-07T12:02:28 Z Ahmed57 Simurgh (IOI17_simurgh) C++17
30 / 100
 3000 ms 36844 KB 
#include "bits/stdc++.h"
#include "simurgh.h"

using namespace std;
set<pair<int,int>> edges , bad;
map<pair<int,int>,int> mp;
set<int> adj[100001],ne[100001];
map<int,int> good;
int vis[100001];
void dfs(int i){
    vis[i] = 1;
    for(auto j:adj[i]){
        if(!vis[j]){
            dfs(j);
            edges.insert({i,j});
            ne[i].insert(j);
            ne[j].insert(i);
        }else{
            bad.insert({i,j});
        }
    }
}
vector<int> v , an;
void go(int i,int pr,int targ){
    v.push_back(i);
    if(i==targ){
        an = v;
    }
    for(auto j:ne[i]){
        if(j==pr)continue;
        go(j,i,targ);
    }
    v.pop_back();
}

int qu(){
    vector<int> r;
    for(auto j:edges){
        r.push_back(mp[j]);
    }
    return count_common_roads(r);
}
mt19937 rnd;
vector<int> find_roads(int n,vector<int> u,vector<int> v){
    rnd.seed(n);
    edges.clear();
    for(int i = 0;i<n;i++){
        adj[i].clear();
        vis[i] =0;
    }
    for(int i = 0;i<u.size();i++){
        adj[u[i]].insert(v[i]);
        adj[v[i]].insert(u[i]);
        mp[{u[i],v[i]}] = i;
        mp[{v[i],u[i]}] = i;
    }
    set<pair<int,int>> s;
    dfs(0);
    int cost = qu();
    while(cost<n-1){
        int x = rnd()%bad.size();
        auto it = bad.begin();
        while(x--)it++;
        pair<int,int> p = (*it);
        bad.erase(it);
        v.clear();an.clear();
        go(p.first,-1,p.second);
        x = rnd()%(an.size()-1);
        pair<int,int> P = make_pair(an[x],an[x+1]);
        auto IT = edges.lower_bound(P);
        if(IT==edges.end()||(*IT)!=P){
            swap(P.first,P.second);
            IT = edges.lower_bound(P);
        }
        edges.erase(IT);
        edges.insert(p);
        int ncost = qu();
        if(ncost>cost){
            ne[P.first].erase(P.second);
            ne[P.second].erase(P.first);
            ne[p.first].insert(p.second);
            ne[p.second].insert(p.first);
            cost = ncost;
            continue;
        }else if(ncost<cost){
            edges.erase(edges.lower_bound(p));
            edges.insert(P);
        }else{
            ne[P.first].erase(P.second);
            ne[P.second].erase(P.first);
            ne[p.first].insert(p.second);
            ne[p.second].insert(p.first);
            bad.insert(P);
        }
    }
    vector<int> r;
    for(auto i:edges){
        r.push_back(mp[i]);
    }
    return r;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:51:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i = 0;i<u.size();i++){
      |                   ~^~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10076 KB correct
2 Correct 2 ms 10076 KB correct
3 Correct 1 ms 10076 KB correct
4 Correct 2 ms 10076 KB correct
5 Correct 1 ms 10076 KB correct
6 Correct 1 ms 10076 KB correct
7 Correct 2 ms 10076 KB correct
8 Correct 1 ms 10076 KB correct
9 Correct 2 ms 10076 KB correct
10 Correct 1 ms 10076 KB correct
11 Correct 2 ms 10072 KB correct
12 Correct 2 ms 10080 KB correct
13 Correct 2 ms 10068 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10076 KB correct
2 Correct 2 ms 10076 KB correct
3 Correct 1 ms 10076 KB correct
4 Correct 2 ms 10076 KB correct
5 Correct 1 ms 10076 KB correct
6 Correct 1 ms 10076 KB correct
7 Correct 2 ms 10076 KB correct
8 Correct 1 ms 10076 KB correct
9 Correct 2 ms 10076 KB correct
10 Correct 1 ms 10076 KB correct
11 Correct 2 ms 10072 KB correct
12 Correct 2 ms 10080 KB correct
13 Correct 2 ms 10068 KB correct
14 Correct 28 ms 10332 KB correct
15 Correct 24 ms 10332 KB correct
16 Correct 23 ms 10484 KB correct
17 Correct 28 ms 10332 KB correct
18 Correct 10 ms 10076 KB correct
19 Correct 23 ms 10424 KB correct
20 Correct 20 ms 10400 KB correct
21 Correct 18 ms 10328 KB correct
22 Correct 16 ms 10236 KB correct
23 Correct 16 ms 10076 KB correct
24 Correct 13 ms 10276 KB correct
25 Correct 2 ms 10076 KB correct
26 Correct 14 ms 10280 KB correct
27 Correct 14 ms 10284 KB correct
28 Correct 5 ms 10076 KB correct
29 Correct 3 ms 10076 KB correct
30 Correct 15 ms 10076 KB correct
31 Correct 15 ms 10076 KB correct
32 Correct 15 ms 10076 KB correct
33 Correct 14 ms 10292 KB correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10076 KB correct
2 Correct 2 ms 10076 KB correct
3 Correct 1 ms 10076 KB correct
4 Correct 2 ms 10076 KB correct
5 Correct 1 ms 10076 KB correct
6 Correct 1 ms 10076 KB correct
7 Correct 2 ms 10076 KB correct
8 Correct 1 ms 10076 KB correct
9 Correct 2 ms 10076 KB correct
10 Correct 1 ms 10076 KB correct
11 Correct 2 ms 10072 KB correct
12 Correct 2 ms 10080 KB correct
13 Correct 2 ms 10068 KB correct
14 Correct 28 ms 10332 KB correct
15 Correct 24 ms 10332 KB correct
16 Correct 23 ms 10484 KB correct
17 Correct 28 ms 10332 KB correct
18 Correct 10 ms 10076 KB correct
19 Correct 23 ms 10424 KB correct
20 Correct 20 ms 10400 KB correct
21 Correct 18 ms 10328 KB correct
22 Correct 16 ms 10236 KB correct
23 Correct 16 ms 10076 KB correct
24 Correct 13 ms 10276 KB correct
25 Correct 2 ms 10076 KB correct
26 Correct 14 ms 10280 KB correct
27 Correct 14 ms 10284 KB correct
28 Correct 5 ms 10076 KB correct
29 Correct 3 ms 10076 KB correct
30 Correct 15 ms 10076 KB correct
31 Correct 15 ms 10076 KB correct
32 Correct 15 ms 10076 KB correct
33 Correct 14 ms 10292 KB correct
34 Execution timed out 3009 ms 19704 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB correct
2 Correct 1 ms 10076 KB correct
3 Execution timed out 3091 ms 36844 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10076 KB correct
2 Correct 2 ms 10076 KB correct
3 Correct 1 ms 10076 KB correct
4 Correct 2 ms 10076 KB correct
5 Correct 1 ms 10076 KB correct
6 Correct 1 ms 10076 KB correct
7 Correct 2 ms 10076 KB correct
8 Correct 1 ms 10076 KB correct
9 Correct 2 ms 10076 KB correct
10 Correct 1 ms 10076 KB correct
11 Correct 2 ms 10072 KB correct
12 Correct 2 ms 10080 KB correct
13 Correct 2 ms 10068 KB correct
14 Correct 28 ms 10332 KB correct
15 Correct 24 ms 10332 KB correct
16 Correct 23 ms 10484 KB correct
17 Correct 28 ms 10332 KB correct
18 Correct 10 ms 10076 KB correct
19 Correct 23 ms 10424 KB correct
20 Correct 20 ms 10400 KB correct
21 Correct 18 ms 10328 KB correct
22 Correct 16 ms 10236 KB correct
23 Correct 16 ms 10076 KB correct
24 Correct 13 ms 10276 KB correct
25 Correct 2 ms 10076 KB correct
26 Correct 14 ms 10280 KB correct
27 Correct 14 ms 10284 KB correct
28 Correct 5 ms 10076 KB correct
29 Correct 3 ms 10076 KB correct
30 Correct 15 ms 10076 KB correct
31 Correct 15 ms 10076 KB correct
32 Correct 15 ms 10076 KB correct
33 Correct 14 ms 10292 KB correct
34 Execution timed out 3009 ms 19704 KB Time limit exceeded
35 Halted 0 ms 0 KB -