oj.uz

Submission #933995

# Submission time Handle Problem Language Result Execution time Memory
933995 2024-02-26T16:33:51 Z leo_2727 Bridges (APIO19_bridges) C++17
13 / 100
 3000 ms 7504 KB 
#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <unordered_map>
#define F first
#define S second
#define PB push_back
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;

int n, m;
vector<pair<ii, int>> bridges;
vvii al;
bool vis[50005];

void dfs(int node, int w){
    if(vis[node])   return;
    vis[node]=true;
    for(auto ch:al[node])
        if(ch.S>=w)
            dfs(ch.F, w);
}

int main(int argc, const char * argv[]) {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>m;
    al.resize(n+1, vii ());
    bridges.resize(m+1);
    for(int i=1;i<=m;i++){
        int x, y, w;
        cin>>x>>y>>w;
        al[x].PB({y, w});
        al[y].PB({x, w});
        bridges[i]={{x, y}, w};
    }
    int q;  cin>>q;
    while(q--){
        int type, x, y;
        cin>>type>>x>>y;
        if(type==1){
            int a=bridges[x].F.F, b=bridges[x].F.S, w=bridges[x].S;
            bridges[x]={{a, b}, y};
            for(int i=0;i<(int)al[a].size();i++){
                if(al[a][i].F==b && al[a][i].S==w){
                    al[a][i]={b, y};
                    break;
                }
            }
            for(int i=0;i<(int)al[b].size();i++){
                if(al[b][i].F==a && al[b][i].S==w){
                    al[b][i]={a, y};
                    break;
                }
            }
        }
        else{
            memset(vis, false, n+1);
            dfs(x, y);
            int ans=0;
            for(int i=1;i<=n;i++)
                if(vis[i])
                    ans++;
            cout<<ans<<"\n";
        }
    }
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 41 ms 520 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 4 ms 476 KB Output is correct
7 Correct 4 ms 472 KB Output is correct
8 Correct 4 ms 628 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 4 ms 344 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1111 ms 5564 KB Output is correct
2 Correct 1100 ms 6224 KB Output is correct
3 Correct 1130 ms 6204 KB Output is correct
4 Correct 1211 ms 6480 KB Output is correct
5 Correct 1191 ms 6512 KB Output is correct
6 Execution timed out 3090 ms 6408 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1226 ms 3028 KB Output is correct
2 Correct 1672 ms 1368 KB Output is correct
3 Execution timed out 3032 ms 3152 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3032 ms 7504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1111 ms 5564 KB Output is correct
2 Correct 1100 ms 6224 KB Output is correct
3 Correct 1130 ms 6204 KB Output is correct
4 Correct 1211 ms 6480 KB Output is correct
5 Correct 1191 ms 6512 KB Output is correct
6 Execution timed out 3090 ms 6408 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 41 ms 520 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 4 ms 476 KB Output is correct
7 Correct 4 ms 472 KB Output is correct
8 Correct 4 ms 628 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 1111 ms 5564 KB Output is correct
19 Correct 1100 ms 6224 KB Output is correct
20 Correct 1130 ms 6204 KB Output is correct
21 Correct 1211 ms 6480 KB Output is correct
22 Correct 1191 ms 6512 KB Output is correct
23 Execution timed out 3090 ms 6408 KB Time limit exceeded
24 Halted 0 ms 0 KB -