oj.uz

Submission #853855

# Submission time Handle Problem Language Result Execution time Memory
853855 2023-09-25T10:18:23 Z onepunchac168 Keys (IOI21_keys) C++17
100 / 100
 535 ms 63680 KB 
//------------------------------------\\
//   ------------------------------   \\
//  |  created by Dinh Manh Hung   |  \\
//  |      tht.onepunchac168       |  \\
//  |     THPT CHUYEN HA TINH      |  \\
//  |      HA TINH, VIET NAM       |  \\
//  |           Siuuu              |  \\
//   ------------------------------   \\
//------------------------------------\\

#include <bits/stdc++.h>
using namespace std;

#define            task     ""
#define       file(name)    if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define             ldb     long double
#define              pb     push_back
#define              eb     emplace_back
#define              fi     first
#define              se     second
#define           all(x)    begin(x),end(x)
#define       uniquev(v)    v.resize(unique(all(v))-v.begin())
#define       rep(i,a,b)    for (int i=a;i<=b;i++)
#define        cntbit(v)    __builtin_popcountll(v)
#define         gcd(a,b)    __gcd(a,b)
#define         lcm(a,b)    ((1LL*a*b)/__gcd(a,b))
#define          mask(x)    (1LL<<(x))
#define     readbit(x,i)    ((x>>i)&1)
#define             Yes     cout << "Yes"
#define             YES     cout << "YES"
#define              No     cout << "No"
#define              NO     cout << "NO"

typedef long long ll;
typedef pair <ll,ll> ii;
typedef pair <ll,ii> iii;
typedef pair <ii,ii> iiii;

ll dx[]= {1,-1,0,0,1,-1,1,-1};
ll dy[]= {0,0,-1,1,1,-1,-1,1};

const ldb PI = acos (-1);
//const ll mod=978846151;
//const ll base=29;
const ll mod=1e9+7;
const char nl = '\n';

inline int ReadInt()
{
    char co;
    for (co = getchar(); co < '0' || co > '9'; co = getchar());
    int xo = co - '0';
    for (co = getchar(); co >= '0' && co <= '9'; co = getchar())
        xo = (xo<<1) + (xo<<3) + co - '0';
    return xo;
}

void WriteInt(int xo)
{
    if (xo > 9)
        WriteInt(xo / 10);
    putchar(xo % 10 + '0');
}

// DEBUG

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}


#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif


/* END OF TEMPLATE*/

// ================= Solution =================//
/*

void onepunchac168();

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    file(task);
    int tests;
    tests=1;
    //cin>>tests;
    while (tests--)
    {
        onepunchac168();
    }
}

const int N=2e5+5;

void onepunchac168()
{

}
*/
// goodbye see ya

const int N=3e5+5;
struct DSU{
    int lab[N];
    void makeset(int u)
    {
        lab[u]=-1;
    }
    int findset(int u)
    {
        if (lab[u]<0)
        {
            return u;
        }
        return lab[u]=findset(lab[u]);
    }
    void Union(int r,int s)
    {
        lab[r]=s;
    }
} dsu;
int raz[N];
int n;
int pos[N];
bool check[N];
vector <ii> vt[N];
vector <int > color[N];
queue< int > qu;
bool fee[N];
bool check_color[N];
vector <int > ss;
int kq=1e9+5;
vector <int > res;
void solve(int start,int pp)
{
    pos[start]=pp;
    while (!qu.empty())
    {
        qu.pop();
    }
    qu.push(start);
    ss.pb(raz[start]);
    vector <int > gg;
    while (!qu.empty())
    {
        int u=qu.front();
        qu.pop();
        if (dsu.findset(u)!=start)
        {
            pos[dsu.findset(u)]=pp;
            dsu.Union(start,dsu.findset(u));
            return;
        }
        if (fee[u]==0)
        {
            gg.pb(u);
            fee[u]=1;
        }
        else continue;
        if (check_color[raz[u]]==0)
        {
            check_color[raz[u]]=1;
            for (auto v:color[raz[u]])
            {
                qu.push(v);
            }
        }
        for (auto v:vt[u])
        {
            if (check_color[v.se]==1)
            {
                ss.pb(raz[v.fi]);
                qu.push(v.fi);
            }
            else
            {
                color[v.se].pb(v.fi);
                ss.pb(v.se);
            }
        }

    }
    check[start]=1;
    //cout<<start<<" "<<gg.size()<<" === "<<nl;
    if (kq>gg.size())
    {
        res.clear();
        kq=gg.size();
    }
    if (kq==gg.size())
    {
        for (auto v:gg)
        {
            res.pb(v);
        }
    }

}
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	std::vector<int> ans(r.size(),0);
    n=r.size();
    for (int i=1;i<=n;i++)
    {
        raz[i]=r[i-1]+1;
        dsu.makeset(i);
    }
    for (int i=0;i<u.size();i++)
    {
        u[i]++;
        v[i]++;
        c[i]++;
        vt[u[i]].pb({v[i],c[i]});
        vt[v[i]].pb({u[i],c[i]});
    }
    ll id=0;
    while (true)
    {
        id++;
        bool ck=true;
        for (int i=1;i<=n;i++)
        {
            fee[i]=0;
        }
        for (int i=1;i<=n;i++)
        {
            if (dsu.lab[i]==-1&&pos[i]!=id&&check[i]==0)
            {
                ck=false;
                solve(i,id);
                for (auto v:ss)
                {
                    check_color[v]=0;
                    color[v].clear();
                }
                ss.clear();
            }
        }
        if (ck==true)
        {
            break;
        }
    }
    for (auto v:res)
    {
        ans[v-1]=1;
    }
	return ans;
}

Compilation message

keys.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //------------------------------------\\
      | ^
keys.cpp: In function 'void solve(int, int)':
keys.cpp:210:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  210 |     if (kq>gg.size())
      |         ~~^~~~~~~~~~
keys.cpp:215:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  215 |     if (kq==gg.size())
      |         ~~^~~~~~~~~~~
keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:232:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  232 |     for (int i=0;i<u.size();i++)
      |                  ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 3 ms 16848 KB Output is correct
5 Correct 3 ms 16728 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 4 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 3 ms 16848 KB Output is correct
5 Correct 3 ms 16728 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 4 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 3 ms 16732 KB Output is correct
13 Correct 4 ms 16732 KB Output is correct
14 Correct 3 ms 16828 KB Output is correct
15 Correct 3 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 3 ms 16732 KB Output is correct
18 Correct 3 ms 16864 KB Output is correct
19 Correct 3 ms 16732 KB Output is correct
20 Correct 3 ms 16732 KB Output is correct
21 Correct 4 ms 16860 KB Output is correct
22 Correct 4 ms 16732 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 3 ms 16856 KB Output is correct
25 Correct 4 ms 16732 KB Output is correct
26 Correct 3 ms 16732 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 3 ms 16848 KB Output is correct
5 Correct 3 ms 16728 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 4 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 3 ms 16732 KB Output is correct
13 Correct 4 ms 16732 KB Output is correct
14 Correct 3 ms 16828 KB Output is correct
15 Correct 3 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 3 ms 16732 KB Output is correct
18 Correct 3 ms 16864 KB Output is correct
19 Correct 3 ms 16732 KB Output is correct
20 Correct 3 ms 16732 KB Output is correct
21 Correct 4 ms 16860 KB Output is correct
22 Correct 4 ms 16732 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 3 ms 16856 KB Output is correct
25 Correct 4 ms 16732 KB Output is correct
26 Correct 3 ms 16732 KB Output is correct
27 Correct 4 ms 17128 KB Output is correct
28 Correct 6 ms 16984 KB Output is correct
29 Correct 4 ms 16984 KB Output is correct
30 Correct 4 ms 16872 KB Output is correct
31 Correct 4 ms 16732 KB Output is correct
32 Correct 4 ms 16728 KB Output is correct
33 Correct 4 ms 16728 KB Output is correct
34 Correct 4 ms 16984 KB Output is correct
35 Correct 4 ms 16988 KB Output is correct
36 Correct 4 ms 16920 KB Output is correct
37 Correct 4 ms 16984 KB Output is correct
38 Correct 4 ms 17124 KB Output is correct
39 Correct 4 ms 16988 KB Output is correct
40 Correct 4 ms 16996 KB Output is correct
41 Correct 4 ms 16984 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 3 ms 16848 KB Output is correct
5 Correct 3 ms 16728 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 4 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 174 ms 47096 KB Output is correct
11 Correct 173 ms 54092 KB Output is correct
12 Correct 34 ms 23376 KB Output is correct
13 Correct 200 ms 49352 KB Output is correct
14 Correct 142 ms 57016 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 3 ms 16848 KB Output is correct
5 Correct 3 ms 16728 KB Output is correct
6 Correct 3 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 4 ms 16732 KB Output is correct
9 Correct 3 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 3 ms 16732 KB Output is correct
13 Correct 4 ms 16732 KB Output is correct
14 Correct 3 ms 16828 KB Output is correct
15 Correct 3 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 3 ms 16732 KB Output is correct
18 Correct 3 ms 16864 KB Output is correct
19 Correct 3 ms 16732 KB Output is correct
20 Correct 3 ms 16732 KB Output is correct
21 Correct 4 ms 16860 KB Output is correct
22 Correct 4 ms 16732 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 3 ms 16856 KB Output is correct
25 Correct 4 ms 16732 KB Output is correct
26 Correct 3 ms 16732 KB Output is correct
27 Correct 4 ms 17128 KB Output is correct
28 Correct 6 ms 16984 KB Output is correct
29 Correct 4 ms 16984 KB Output is correct
30 Correct 4 ms 16872 KB Output is correct
31 Correct 4 ms 16732 KB Output is correct
32 Correct 4 ms 16728 KB Output is correct
33 Correct 4 ms 16728 KB Output is correct
34 Correct 4 ms 16984 KB Output is correct
35 Correct 4 ms 16988 KB Output is correct
36 Correct 4 ms 16920 KB Output is correct
37 Correct 4 ms 16984 KB Output is correct
38 Correct 4 ms 17124 KB Output is correct
39 Correct 4 ms 16988 KB Output is correct
40 Correct 4 ms 16996 KB Output is correct
41 Correct 4 ms 16984 KB Output is correct
42 Correct 174 ms 47096 KB Output is correct
43 Correct 173 ms 54092 KB Output is correct
44 Correct 34 ms 23376 KB Output is correct
45 Correct 200 ms 49352 KB Output is correct
46 Correct 142 ms 57016 KB Output is correct
47 Correct 3 ms 16732 KB Output is correct
48 Correct 3 ms 16732 KB Output is correct
49 Correct 3 ms 16732 KB Output is correct
50 Correct 125 ms 58380 KB Output is correct
51 Correct 140 ms 58896 KB Output is correct
52 Correct 161 ms 48332 KB Output is correct
53 Correct 166 ms 48328 KB Output is correct
54 Correct 163 ms 48276 KB Output is correct
55 Correct 204 ms 50760 KB Output is correct
56 Correct 248 ms 56476 KB Output is correct
57 Correct 184 ms 57780 KB Output is correct
58 Correct 199 ms 62896 KB Output is correct
59 Correct 283 ms 59588 KB Output is correct
60 Correct 227 ms 55504 KB Output is correct
61 Correct 274 ms 63680 KB Output is correct
62 Correct 531 ms 58456 KB Output is correct
63 Correct 138 ms 51724 KB Output is correct
64 Correct 5 ms 17496 KB Output is correct
65 Correct 5 ms 17500 KB Output is correct
66 Correct 535 ms 58136 KB Output is correct
67 Correct 16 ms 20440 KB Output is correct
68 Correct 25 ms 23120 KB Output is correct
69 Correct 291 ms 59656 KB Output is correct
70 Correct 49 ms 29252 KB Output is correct
71 Correct 137 ms 56336 KB Output is correct
72 Correct 296 ms 59744 KB Output is correct
73 Correct 505 ms 57796 KB Output is correct