oj.uz

답안 #498190

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498190 2021-12-24T14:51:42 Z Kipras Monthly railway pass (LMIO18_menesinis_bilietas) C++14
65 / 100
 3000 ms 45548 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxN = 1e5*5+1;

int n, m;
vector<pair<bool, int>> adj[maxN];
int par[maxN];
int s[maxN];
vector<int> routes[maxN];
bool checkedContainer[maxN];

int find(int a){
    if(par[a]==a)return a;
    return par[a]=find(par[a]);
}

void unite(int a, int b){
    a = find(a), b = find(b);
    if(a==b)return;
    par[b]=a;
    s[a]+=s[b];
}

bool same(int a, int b){
    return find(a)==find(b);
}

int main()
{

    ios_base::sync_with_stdio(0);cin.tie(nullptr);

    cin>>n>>m;

    for(int i = 0; i < m; i++){
        int a, b;
        char t;
        bool type;
        cin>>a>>b>>t;
        if(t=='A')type=0;
        else type=1;
        adj[a].push_back({type, b});
        adj[b].push_back({type, a});
    }

    for(int i = 0; i < maxN; i++)par[i]=i;
    for(int i = 0; i < maxN; i++)s[i]=1;

    for(int i = 1; i <= n; i++){
        for(auto x : adj[i]){
            if(x.first==0){

            }else{
                unite(x.second, i);
            }
        }
    }



    for(int i = 1; i <= n; i++){
        for(auto x : adj[i]){
            if(x.first==0){
                routes[find(i)].push_back(find(x.second));
                routes[find(x.second)].push_back(find(i));
            }else{

            }
        }
    }

    int ans=0;



    for(int i = 1; i <= n; i++){
        if(checkedContainer[find(i)])continue;
        int ss=s[find(i)];
        bool checked[maxN];
        fill(checked, checked+maxN, 0);
        for(auto x : routes[find(i)]){
            if(!same(i, x)&&!checked[find(x)]){
                ss+=s[find(x)];
                checked[find(x)]=1;
            }
        }
        if(ss==n){
            ans+=s[find(i)];
            checkedContainer[find(i)]=true;
        }
    }

    cout<<ans;


    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 413 ms 43176 KB Output is correct
2 Correct 16 ms 28108 KB Output is correct
3 Correct 20 ms 28108 KB Output is correct
4 Execution timed out 3068 ms 28132 KB Time limit exceeded

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3068 ms 28132 KB Time limit exceeded

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28108 KB Output is correct
2 Correct 20 ms 28108 KB Output is correct
3 Correct 15 ms 28108 KB Output is correct
4 Correct 18 ms 28184 KB Output is correct
5 Correct 18 ms 28368 KB Output is correct
6 Correct 17 ms 28364 KB Output is correct
7 Correct 25 ms 28612 KB Output is correct
8 Correct 22 ms 28492 KB Output is correct
9 Correct 20 ms 28108 KB Output is correct
10 Correct 18 ms 28216 KB Output is correct
11 Correct 31 ms 28724 KB Output is correct
12 Correct 16 ms 28088 KB Output is correct
13 Correct 26 ms 28312 KB Output is correct
14 Correct 16 ms 28200 KB Output is correct
15 Correct 17 ms 28316 KB Output is correct
16 Correct 16 ms 28304 KB Output is correct
17 Correct 24 ms 28344 KB Output is correct
18 Correct 19 ms 28108 KB Output is correct
19 Correct 19 ms 28176 KB Output is correct
20 Correct 30 ms 28564 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28108 KB Output is correct
2 Correct 18 ms 28184 KB Output is correct
3 Correct 18 ms 28368 KB Output is correct
4 Correct 17 ms 28364 KB Output is correct
5 Correct 25 ms 28612 KB Output is correct
6 Correct 22 ms 28492 KB Output is correct
7 Correct 20 ms 28108 KB Output is correct
8 Correct 18 ms 28216 KB Output is correct
9 Correct 31 ms 28724 KB Output is correct
10 Correct 16 ms 28088 KB Output is correct
11 Correct 26 ms 28312 KB Output is correct
12 Correct 16 ms 28200 KB Output is correct
13 Correct 17 ms 28316 KB Output is correct
14 Correct 16 ms 28304 KB Output is correct
15 Correct 24 ms 28344 KB Output is correct
16 Correct 16 ms 28108 KB Output is correct
17 Correct 20 ms 28108 KB Output is correct
18 Correct 19 ms 28108 KB Output is correct
19 Correct 19 ms 28176 KB Output is correct
20 Correct 30 ms 28564 KB Output is correct
21 Correct 27 ms 29764 KB Output is correct
22 Correct 410 ms 45548 KB Output is correct
23 Correct 63 ms 35396 KB Output is correct
24 Correct 72 ms 37888 KB Output is correct
25 Correct 50 ms 33844 KB Output is correct
26 Correct 289 ms 36452 KB Output is correct
27 Correct 198 ms 28172 KB Output is correct
28 Correct 184 ms 29412 KB Output is correct
29 Correct 212 ms 29880 KB Output is correct
30 Correct 60 ms 32964 KB Output is correct

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28108 KB Output is correct
2 Correct 18 ms 28184 KB Output is correct
3 Correct 18 ms 28368 KB Output is correct
4 Correct 17 ms 28364 KB Output is correct
5 Correct 25 ms 28612 KB Output is correct
6 Correct 22 ms 28492 KB Output is correct
7 Correct 20 ms 28108 KB Output is correct
8 Correct 18 ms 28216 KB Output is correct
9 Correct 31 ms 28724 KB Output is correct
10 Correct 16 ms 28088 KB Output is correct
11 Correct 26 ms 28312 KB Output is correct
12 Correct 16 ms 28200 KB Output is correct
13 Correct 17 ms 28316 KB Output is correct
14 Correct 16 ms 28304 KB Output is correct
15 Correct 24 ms 28344 KB Output is correct
16 Correct 27 ms 29764 KB Output is correct
17 Correct 410 ms 45548 KB Output is correct
18 Correct 63 ms 35396 KB Output is correct
19 Correct 72 ms 37888 KB Output is correct
20 Correct 50 ms 33844 KB Output is correct
21 Correct 289 ms 36452 KB Output is correct
22 Correct 413 ms 43176 KB Output is correct
23 Correct 16 ms 28108 KB Output is correct
24 Correct 20 ms 28108 KB Output is correct
25 Execution timed out 3068 ms 28132 KB Time limit exceeded