oj.uz

답안 #825857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
825857 2023-08-15T08:51:17 Z AlphaMale06 Monthly railway pass (LMIO18_menesinis_bilietas) C++14
10 / 100
 365 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;

#define F first
#define S second
#define mp make_pair
#define pb push_back

const int N = 5000005;
int p[N];
int sz[N];
set<int> reps;
set<pair<int, int>, less<pair<int, int>>> adj[N];
vector<pair<int, int>> paid;

void make(int v){p[v]=v; sz[v]=1;}

int rep(int v){
    if(p[v]==v)return v;
    return p[v]=rep(p[v]);
}

void unite(int v, int u){
    v=rep(v);
    u=rep(u);
    if(u==v)return;
    if(sz[u]>sz[v]){
        swap(u, v);
    }
    p[v]=u;
    sz[u]+=sz[v];
    reps.erase(reps.find(v));
}



int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for(int i=1; i<=n; i++){
        make(i);
        reps.insert(i);
    }
    for(int i=0; i< m; i++){
        int x, y;
        char a;
        cin >> x >> y >> a;
        if(a=='T'){
            unite(x, y);
        }
        else paid.pb(mp(x, y));
    }
    for(int i=0; i< paid.size(); i++){
        int x=paid[i].F;
        int y=paid[i].S;
        x=rep(x);
        y=rep(y);
        adj[x].insert(mp(x, y));
        adj[y].insert(mp(x, y));
        adj[y].insert(mp(y, x));
        adj[x].insert(mp(y, x));
    }
    int ans=0;
    for(auto it = reps.begin(); it!=reps.end(); it++){
        int node=*it;
        if(adj[node].size()==2*(reps.size()-1)){
            ans+=sz[node];
        }
    }
    cout << ans << '\n';
}

Compilation message

menesinis_bilietas.cpp: In function 'int main()':
menesinis_bilietas.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i=0; i< paid.size(); i++){
      |                  ~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 365 ms 251396 KB Output is correct
2 Correct 97 ms 235052 KB Output is correct
3 Correct 96 ms 235128 KB Output is correct
4 Correct 190 ms 260812 KB Output is correct
5 Correct 98 ms 235812 KB Output is correct
6 Correct 122 ms 235484 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 260812 KB Output is correct
2 Correct 98 ms 235812 KB Output is correct
3 Correct 96 ms 235140 KB Output is correct
4 Correct 96 ms 235276 KB Output is correct
5 Correct 105 ms 236696 KB Output is correct
6 Runtime error 222 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 235052 KB Output is correct
2 Correct 96 ms 235128 KB Output is correct
3 Correct 96 ms 235140 KB Output is correct
4 Correct 96 ms 235276 KB Output is correct
5 Correct 105 ms 236696 KB Output is correct
6 Correct 96 ms 235084 KB Output is correct
7 Correct 96 ms 235080 KB Output is correct
8 Correct 95 ms 235204 KB Output is correct
9 Correct 96 ms 235272 KB Output is correct
10 Incorrect 98 ms 235280 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 235084 KB Output is correct
2 Correct 96 ms 235080 KB Output is correct
3 Correct 95 ms 235204 KB Output is correct
4 Correct 96 ms 235272 KB Output is correct
5 Incorrect 98 ms 235280 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 235084 KB Output is correct
2 Correct 96 ms 235080 KB Output is correct
3 Correct 95 ms 235204 KB Output is correct
4 Correct 96 ms 235272 KB Output is correct
5 Incorrect 98 ms 235280 KB Output isn't correct
6 Halted 0 ms 0 KB -