oj.uz

답안 #494448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494448 2021-12-15T13:17:34 Z Khizri 열쇠 (IOI21_keys) C++17
37 / 100
 476 ms 17812 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define F first
#define S second
const int mxn=2000+5;
int n,m;
vector<pii>vtt[mxn];
int bfs(int u,vector<int> &r){
    vector<queue<int>>arr(m+5);
    queue<int>q;
    vector<int>mp(m+5);
    vector<int>color(n+5);
    q.push(u);
    mp[r[u]]=1;
    int ans=1;
    while(q.size()){
        int u=q.front();
        q.pop();
        while(arr[r[u]].size()){
            int x=arr[r[u]].front();
            arr[r[u]].pop();
            if(color[x]) continue;
            ans++;
            q.push(x);
            mp[r[x]]=1;
            color[x]=1;
        }
        for(pii p:vtt[u]){
            int v=p.F,k=p.S;
            if(color[v]) continue;
            if(mp[k]){
                ans++;
                q.push(v);
                mp[r[v]]=1;
                color[v]=1;
            }
            else{
                arr[k].push(v);
            }
        }
    }
    return ans;
}
vector<int> find_reachable(vector<int> r,vector<int> u,vector<int> v,vector<int> c) {
    n=r.size();
    m=u.size();
	for(int i=0;i<m;i++){
        vtt[u[i]].pb({v[i],c[i]});
        vtt[v[i]].pb({u[i],c[i]});
	}
	int cnt=1e7;
	vector<int>ans;
    for(int i=0;i<n;i++){
        int x=bfs(i,r);
        cnt=min(x,cnt);
        ans.pb(x);
    }
    for(int i=0;i<n;i++){
        if(ans[i]==cnt){
            ans[i]=1;
        }
        else{
            ans[i]=0;
        }
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 5 ms 488 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 5 ms 488 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 6 ms 460 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 4 ms 460 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 5 ms 460 KB Output is correct
26 Correct 4 ms 460 KB Output is correct
27 Correct 366 ms 1880 KB Output is correct
28 Correct 380 ms 1944 KB Output is correct
29 Correct 416 ms 1888 KB Output is correct
30 Correct 91 ms 972 KB Output is correct
31 Correct 79 ms 1100 KB Output is correct
32 Correct 10 ms 588 KB Output is correct
33 Correct 64 ms 1096 KB Output is correct
34 Correct 102 ms 972 KB Output is correct
35 Correct 90 ms 1100 KB Output is correct
36 Correct 376 ms 1868 KB Output is correct
37 Correct 337 ms 1836 KB Output is correct
38 Correct 458 ms 1980 KB Output is correct
39 Correct 476 ms 1868 KB Output is correct
40 Correct 102 ms 1228 KB Output is correct
41 Correct 200 ms 1836 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 5 ms 488 KB Output is correct
10 Runtime error 88 ms 17812 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 5 ms 488 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 6 ms 460 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 4 ms 460 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 5 ms 460 KB Output is correct
26 Correct 4 ms 460 KB Output is correct
27 Correct 366 ms 1880 KB Output is correct
28 Correct 380 ms 1944 KB Output is correct
29 Correct 416 ms 1888 KB Output is correct
30 Correct 91 ms 972 KB Output is correct
31 Correct 79 ms 1100 KB Output is correct
32 Correct 10 ms 588 KB Output is correct
33 Correct 64 ms 1096 KB Output is correct
34 Correct 102 ms 972 KB Output is correct
35 Correct 90 ms 1100 KB Output is correct
36 Correct 376 ms 1868 KB Output is correct
37 Correct 337 ms 1836 KB Output is correct
38 Correct 458 ms 1980 KB Output is correct
39 Correct 476 ms 1868 KB Output is correct
40 Correct 102 ms 1228 KB Output is correct
41 Correct 200 ms 1836 KB Output is correct
42 Runtime error 88 ms 17812 KB Execution killed with signal 11
43 Halted 0 ms 0 KB -