oj.uz

Submission #839324

# Submission time Handle Problem Language Result Execution time Memory
839324 2023-08-29T17:12:41 Z andrei_boaca Keys (IOI21_keys) C++17
100 / 100
 766 ms 56684 KB 
#include <vector>
#include <bits/stdc++.h>
#include "keys.h"
//#include "grader.cpp"
using namespace std;
mt19937_64 rng(chrono::steady_clock().now().time_since_epoch().count());
typedef pair<int,int> pii;
int cnt[300005],use[300005],fin[300005],have[300005],my[300005];
set<int> setik;
vector<pii> muchii[300005];
vector<int> block[300005];
vector<int> inblock;
void plsclean()
{
    for(int i:inblock)
        block[i].clear();
    inblock.clear();
}
int bfs(int x)
{
    queue<int> coada;
    int rez=1;
    coada.push(x);
    use[x]=x+1;
    vector<int> viz;
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        int c=my[nod];
        if(have[c]!=x+1)
        {
            have[c]=x+1;
            for(int i:block[c])
                if(use[i]!=x+1)
                {
                    if(fin[i])
                        return 1e6;
                    use[i]=x+1;
                    rez++;
                    viz.push_back(i);
                    coada.push(i);
                }
            block[c].clear();
        }
        for(pii i:muchii[nod])
        {
            int a=i.first;
            int need=i.second;
            if(use[a]==x+1)
                continue;
            if(have[need]==x+1)
            {
                if(fin[a])
                    return 1e6;
                use[a]=x+1;
                rez++;
                viz.push_back(a);
                coada.push(a);
            }
            else
            {
                block[need].push_back(a);
                inblock.push_back(need);
            }
        }
    }
    for(int i:viz)
        cnt[i]=min(cnt[i],rez);
    return rez;
}
int n,minim=1e9;
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();
	vector<int> ord;
    for(int i=0;i<n;i++)
    {
        my[i]=r[i];
        cnt[i]=1e6;
        ord.push_back(i);
    }
    vector<int> p;
    for(int i=0;i<u.size();i++)
    {
        int a=u[i];
        int b=v[i];
        int cheie=c[i];
        p.push_back(a);
        p.push_back(b);
        muchii[a].push_back({b,cheie});
        muchii[b].push_back({a,cheie});
    }
    shuffle(p.begin(),p.end(),rng);
    for(int i:p)
        if(!fin[i])
        {
            cnt[i]=min(cnt[i],bfs(i));
            plsclean();
            minim=min(minim,cnt[i]);
            fin[i]=1;
        }
    for(int i:ord)
        if(!fin[i])
        {
            cnt[i]=min(cnt[i],bfs(i));
            plsclean();
            minim=min(minim,cnt[i]);
            fin[i]=1;
        }
    for(int i=0;i<n;i++)
        if(cnt[i]==minim)
            ans[i]=1;
	return ans;
}

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:84:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int i=0;i<u.size();i++)
      |                 ~^~~~~~~~~
keys.cpp:111:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  111 |     for(int i=0;i<n;i++)
      |     ^~~
keys.cpp:114:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  114 |  return ans;
      |  ^~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14424 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 6 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 6 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 7 ms 14420 KB Output is correct
13 Correct 7 ms 14424 KB Output is correct
14 Correct 6 ms 14420 KB Output is correct
15 Correct 7 ms 14448 KB Output is correct
16 Correct 8 ms 14416 KB Output is correct
17 Correct 6 ms 14420 KB Output is correct
18 Correct 6 ms 14436 KB Output is correct
19 Correct 6 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14448 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 7 ms 14452 KB Output is correct
25 Correct 7 ms 14380 KB Output is correct
26 Correct 6 ms 14372 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14424 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 6 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 6 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 7 ms 14420 KB Output is correct
13 Correct 7 ms 14424 KB Output is correct
14 Correct 6 ms 14420 KB Output is correct
15 Correct 7 ms 14448 KB Output is correct
16 Correct 8 ms 14416 KB Output is correct
17 Correct 6 ms 14420 KB Output is correct
18 Correct 6 ms 14436 KB Output is correct
19 Correct 6 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14448 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 7 ms 14452 KB Output is correct
25 Correct 7 ms 14380 KB Output is correct
26 Correct 6 ms 14372 KB Output is correct
27 Correct 8 ms 14676 KB Output is correct
28 Correct 7 ms 14676 KB Output is correct
29 Correct 8 ms 14676 KB Output is correct
30 Correct 7 ms 14504 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 6 ms 14420 KB Output is correct
33 Correct 7 ms 14444 KB Output is correct
34 Correct 7 ms 14420 KB Output is correct
35 Correct 7 ms 14420 KB Output is correct
36 Correct 8 ms 14544 KB Output is correct
37 Correct 8 ms 14632 KB Output is correct
38 Correct 9 ms 14548 KB Output is correct
39 Correct 8 ms 14532 KB Output is correct
40 Correct 7 ms 14456 KB Output is correct
41 Correct 8 ms 14548 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14424 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 6 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 6 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 224 ms 37388 KB Output is correct
11 Correct 210 ms 49788 KB Output is correct
12 Correct 43 ms 19936 KB Output is correct
13 Correct 214 ms 40928 KB Output is correct
14 Correct 241 ms 44568 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14424 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 6 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 6 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 7 ms 14420 KB Output is correct
13 Correct 7 ms 14424 KB Output is correct
14 Correct 6 ms 14420 KB Output is correct
15 Correct 7 ms 14448 KB Output is correct
16 Correct 8 ms 14416 KB Output is correct
17 Correct 6 ms 14420 KB Output is correct
18 Correct 6 ms 14436 KB Output is correct
19 Correct 6 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14448 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 7 ms 14452 KB Output is correct
25 Correct 7 ms 14380 KB Output is correct
26 Correct 6 ms 14372 KB Output is correct
27 Correct 8 ms 14676 KB Output is correct
28 Correct 7 ms 14676 KB Output is correct
29 Correct 8 ms 14676 KB Output is correct
30 Correct 7 ms 14504 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 6 ms 14420 KB Output is correct
33 Correct 7 ms 14444 KB Output is correct
34 Correct 7 ms 14420 KB Output is correct
35 Correct 7 ms 14420 KB Output is correct
36 Correct 8 ms 14544 KB Output is correct
37 Correct 8 ms 14632 KB Output is correct
38 Correct 9 ms 14548 KB Output is correct
39 Correct 8 ms 14532 KB Output is correct
40 Correct 7 ms 14456 KB Output is correct
41 Correct 8 ms 14548 KB Output is correct
42 Correct 224 ms 37388 KB Output is correct
43 Correct 210 ms 49788 KB Output is correct
44 Correct 43 ms 19936 KB Output is correct
45 Correct 214 ms 40928 KB Output is correct
46 Correct 241 ms 44568 KB Output is correct
47 Correct 7 ms 14420 KB Output is correct
48 Correct 7 ms 14420 KB Output is correct
49 Correct 7 ms 14420 KB Output is correct
50 Correct 244 ms 46972 KB Output is correct
51 Correct 222 ms 46328 KB Output is correct
52 Correct 484 ms 42164 KB Output is correct
53 Correct 472 ms 42140 KB Output is correct
54 Correct 415 ms 42084 KB Output is correct
55 Correct 284 ms 37972 KB Output is correct
56 Correct 500 ms 48572 KB Output is correct
57 Correct 260 ms 47728 KB Output is correct
58 Correct 279 ms 56684 KB Output is correct
59 Correct 657 ms 54396 KB Output is correct
60 Correct 632 ms 52272 KB Output is correct
61 Correct 746 ms 52436 KB Output is correct
62 Correct 483 ms 46764 KB Output is correct
63 Correct 188 ms 47588 KB Output is correct
64 Correct 9 ms 14932 KB Output is correct
65 Correct 10 ms 15024 KB Output is correct
66 Correct 517 ms 46800 KB Output is correct
67 Correct 25 ms 18000 KB Output is correct
68 Correct 37 ms 20292 KB Output is correct
69 Correct 766 ms 54404 KB Output is correct
70 Correct 71 ms 26176 KB Output is correct
71 Correct 255 ms 50820 KB Output is correct
72 Correct 687 ms 54388 KB Output is correct
73 Correct 632 ms 46752 KB Output is correct