oj.uz

답안 #839332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839332 2023-08-29T17:24:53 Z andrei_boaca 열쇠 (IOI21_keys) C++17
100 / 100
 727 ms 56564 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])
        {
            if(!muchii[i].empty())
                return ans;
            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:113:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  113 |     for(int i=0;i<n;i++)
      |     ^~~
keys.cpp:116:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  116 |  return ans;
      |  ^~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14328 KB Output is correct
8 Correct 7 ms 14336 KB Output is correct
9 Correct 6 ms 14420 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14328 KB Output is correct
8 Correct 7 ms 14336 KB Output is correct
9 Correct 6 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 6 ms 14420 KB Output is correct
12 Correct 7 ms 14420 KB Output is correct
13 Correct 6 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 6 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 6 ms 14420 KB Output is correct
20 Correct 6 ms 14420 KB Output is correct
21 Correct 6 ms 14420 KB Output is correct
22 Correct 7 ms 14408 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 6 ms 14420 KB Output is correct
25 Correct 7 ms 14420 KB Output is correct
26 Correct 6 ms 14420 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14328 KB Output is correct
8 Correct 7 ms 14336 KB Output is correct
9 Correct 6 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 6 ms 14420 KB Output is correct
12 Correct 7 ms 14420 KB Output is correct
13 Correct 6 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 6 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 6 ms 14420 KB Output is correct
20 Correct 6 ms 14420 KB Output is correct
21 Correct 6 ms 14420 KB Output is correct
22 Correct 7 ms 14408 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 6 ms 14420 KB Output is correct
25 Correct 7 ms 14420 KB Output is correct
26 Correct 6 ms 14420 KB Output is correct
27 Correct 8 ms 14676 KB Output is correct
28 Correct 8 ms 14676 KB Output is correct
29 Correct 8 ms 14676 KB Output is correct
30 Correct 7 ms 14420 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 7 ms 14420 KB Output is correct
33 Correct 7 ms 14420 KB Output is correct
34 Correct 7 ms 14420 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 8 ms 14548 KB Output is correct
37 Correct 7 ms 14548 KB Output is correct
38 Correct 8 ms 14620 KB Output is correct
39 Correct 8 ms 14548 KB Output is correct
40 Correct 7 ms 14420 KB Output is correct
41 Correct 7 ms 14548 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14328 KB Output is correct
8 Correct 7 ms 14336 KB Output is correct
9 Correct 6 ms 14420 KB Output is correct
10 Correct 235 ms 37784 KB Output is correct
11 Correct 220 ms 49784 KB Output is correct
12 Correct 41 ms 20036 KB Output is correct
13 Correct 266 ms 40876 KB Output is correct
14 Correct 245 ms 44668 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14420 KB Output is correct
2 Correct 6 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14328 KB Output is correct
8 Correct 7 ms 14336 KB Output is correct
9 Correct 6 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 6 ms 14420 KB Output is correct
12 Correct 7 ms 14420 KB Output is correct
13 Correct 6 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 6 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 6 ms 14420 KB Output is correct
20 Correct 6 ms 14420 KB Output is correct
21 Correct 6 ms 14420 KB Output is correct
22 Correct 7 ms 14408 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 6 ms 14420 KB Output is correct
25 Correct 7 ms 14420 KB Output is correct
26 Correct 6 ms 14420 KB Output is correct
27 Correct 8 ms 14676 KB Output is correct
28 Correct 8 ms 14676 KB Output is correct
29 Correct 8 ms 14676 KB Output is correct
30 Correct 7 ms 14420 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 7 ms 14420 KB Output is correct
33 Correct 7 ms 14420 KB Output is correct
34 Correct 7 ms 14420 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 8 ms 14548 KB Output is correct
37 Correct 7 ms 14548 KB Output is correct
38 Correct 8 ms 14620 KB Output is correct
39 Correct 8 ms 14548 KB Output is correct
40 Correct 7 ms 14420 KB Output is correct
41 Correct 7 ms 14548 KB Output is correct
42 Correct 235 ms 37784 KB Output is correct
43 Correct 220 ms 49784 KB Output is correct
44 Correct 41 ms 20036 KB Output is correct
45 Correct 266 ms 40876 KB Output is correct
46 Correct 245 ms 44668 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 217 ms 45700 KB Output is correct
51 Correct 241 ms 46392 KB Output is correct
52 Correct 455 ms 42028 KB Output is correct
53 Correct 459 ms 42292 KB Output is correct
54 Correct 512 ms 42124 KB Output is correct
55 Correct 292 ms 38024 KB Output is correct
56 Correct 487 ms 48572 KB Output is correct
57 Correct 259 ms 48180 KB Output is correct
58 Correct 270 ms 56564 KB Output is correct
59 Correct 681 ms 47432 KB Output is correct
60 Correct 727 ms 45524 KB Output is correct
61 Correct 721 ms 45448 KB Output is correct
62 Correct 462 ms 40632 KB Output is correct
63 Correct 186 ms 40980 KB Output is correct
64 Correct 10 ms 14932 KB Output is correct
65 Correct 10 ms 14932 KB Output is correct
66 Correct 456 ms 40664 KB Output is correct
67 Correct 25 ms 17352 KB Output is correct
68 Correct 36 ms 19344 KB Output is correct
69 Correct 651 ms 47476 KB Output is correct
70 Correct 67 ms 24256 KB Output is correct
71 Correct 245 ms 44600 KB Output is correct
72 Correct 651 ms 47412 KB Output is correct
73 Correct 456 ms 40688 KB Output is correct