oj.uz

답안 #839327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839327 2023-08-29T17:18:00 Z andrei_boaca 열쇠 (IOI21_keys) C++17
67 / 100
 3000 ms 56380 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;
bool found[300005];
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);
        found[a]=1;
        found[b]=1;
        muchii[a].push_back({b,cheie});
        muchii[b].push_back({a,cheie});
    }
    shuffle(ord.begin(),ord.end(),rng);
    for(int i:ord)
        if(!found[i]&&!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:85:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for(int i=0;i<u.size();i++)
      |                 ~^~~~~~~~~
keys.cpp:114:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  114 |     for(int i=0;i<n;i++)
      |     ^~~
keys.cpp:117:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  117 |  return ans;
      |  ^~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14356 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 14412 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14436 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14356 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 14412 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14436 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 6 ms 14420 KB Output is correct
14 Correct 6 ms 14432 KB Output is correct
15 Correct 6 ms 14340 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 7 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 14428 KB Output is correct
23 Correct 6 ms 14452 KB Output is correct
24 Correct 6 ms 14420 KB Output is correct
25 Correct 6 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 7 ms 14356 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 14412 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14436 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 6 ms 14420 KB Output is correct
14 Correct 6 ms 14432 KB Output is correct
15 Correct 6 ms 14340 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 7 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 14428 KB Output is correct
23 Correct 6 ms 14452 KB Output is correct
24 Correct 6 ms 14420 KB Output is correct
25 Correct 6 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 7 ms 14676 KB Output is correct
29 Correct 9 ms 14688 KB Output is correct
30 Correct 7 ms 14548 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 9 ms 14492 KB Output is correct
35 Correct 9 ms 14420 KB Output is correct
36 Correct 8 ms 14548 KB Output is correct
37 Correct 8 ms 14552 KB Output is correct
38 Correct 8 ms 14592 KB Output is correct
39 Correct 8 ms 14548 KB Output is correct
40 Correct 7 ms 14548 KB Output is correct
41 Correct 7 ms 14548 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14356 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 14412 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14436 KB Output is correct
10 Correct 233 ms 37884 KB Output is correct
11 Correct 558 ms 50176 KB Output is correct
12 Correct 38 ms 20044 KB Output is correct
13 Correct 248 ms 41168 KB Output is correct
14 Correct 243 ms 44812 KB Output is correct

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14356 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 14412 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 6 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 8 ms 14436 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 6 ms 14420 KB Output is correct
14 Correct 6 ms 14432 KB Output is correct
15 Correct 6 ms 14340 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 6 ms 14420 KB Output is correct
19 Correct 7 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 14428 KB Output is correct
23 Correct 6 ms 14452 KB Output is correct
24 Correct 6 ms 14420 KB Output is correct
25 Correct 6 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 7 ms 14676 KB Output is correct
29 Correct 9 ms 14688 KB Output is correct
30 Correct 7 ms 14548 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 9 ms 14492 KB Output is correct
35 Correct 9 ms 14420 KB Output is correct
36 Correct 8 ms 14548 KB Output is correct
37 Correct 8 ms 14552 KB Output is correct
38 Correct 8 ms 14592 KB Output is correct
39 Correct 8 ms 14548 KB Output is correct
40 Correct 7 ms 14548 KB Output is correct
41 Correct 7 ms 14548 KB Output is correct
42 Correct 233 ms 37884 KB Output is correct
43 Correct 558 ms 50176 KB Output is correct
44 Correct 38 ms 20044 KB Output is correct
45 Correct 248 ms 41168 KB Output is correct
46 Correct 243 ms 44812 KB Output is correct
47 Correct 7 ms 14420 KB Output is correct
48 Correct 6 ms 14420 KB Output is correct
49 Correct 6 ms 14420 KB Output is correct
50 Correct 204 ms 46100 KB Output is correct
51 Correct 225 ms 46608 KB Output is correct
52 Correct 357 ms 42232 KB Output is correct
53 Correct 373 ms 42232 KB Output is correct
54 Correct 402 ms 42300 KB Output is correct
55 Correct 299 ms 38124 KB Output is correct
56 Correct 503 ms 48892 KB Output is correct
57 Correct 239 ms 46404 KB Output is correct
58 Execution timed out 3094 ms 56380 KB Time limit exceeded
59 Halted 0 ms 0 KB -