oj.uz

답안 #983167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983167 2024-05-15T08:53:01 Z vjudge1 다리 (APIO19_bridges) C++17
13 / 100
 106 ms 11164 KB 
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
#define ll long long
using namespace std;

int tt = 1, n, m;
ll a[200001], b[200001], c[200001];
vector<pair<int, ll>> g[200005];
bool us[200005];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
        cin >> a[i] >> b[i] >> c[i];
    cin >> tt;
    if(n <= 1000 && m <= 1000 && tt <= 10000){
        for(int i = 1; i <= tt; i++){
            int type;
            cin >> type;
            if(type == 1){
                ll p, num;
                cin >> p >> num;
                c[p] = num; 
            }
            else{
                ll x, w;
                cin >> x >> w; 
                queue<int> q;
                for(int i = 1; i <= n; i++){
                    g[i].clear();
                    us[i] = 0;
                }
                for(int i = 1; i <= m; i++){
                    g[a[i]].push_back({b[i], c[i]});
                    g[b[i]].push_back({a[i], c[i]});
                }
                q.push(x);
                us[x] = 1;
                int kol = 1;
                while(!q.empty()){
                    int d = q.front();
                    q.pop();
                    for(auto to : g[d]){
                        if(!us[to.first] && to.second >= w){
                            kol++;
                            us[to.first] = 1;
                            q.push(to.first);
                        }
                    }
                }
                cout << kol << "\n";
            }
        }
    }
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 106 ms 8888 KB Output is correct
4 Correct 4 ms 6744 KB Output is correct
5 Correct 14 ms 8796 KB Output is correct
6 Correct 13 ms 8792 KB Output is correct
7 Correct 13 ms 8536 KB Output is correct
8 Correct 14 ms 8796 KB Output is correct
9 Correct 14 ms 8768 KB Output is correct
10 Correct 13 ms 9048 KB Output is correct
11 Correct 15 ms 8792 KB Output is correct
12 Correct 12 ms 8796 KB Output is correct
13 Correct 18 ms 8840 KB Output is correct
14 Correct 18 ms 9048 KB Output is correct
15 Correct 19 ms 8796 KB Output is correct
16 Correct 13 ms 8540 KB Output is correct
17 Correct 14 ms 8536 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 9956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 9304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 11164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 9956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 106 ms 8888 KB Output is correct
4 Correct 4 ms 6744 KB Output is correct
5 Correct 14 ms 8796 KB Output is correct
6 Correct 13 ms 8792 KB Output is correct
7 Correct 13 ms 8536 KB Output is correct
8 Correct 14 ms 8796 KB Output is correct
9 Correct 14 ms 8768 KB Output is correct
10 Correct 13 ms 9048 KB Output is correct
11 Correct 15 ms 8792 KB Output is correct
12 Correct 12 ms 8796 KB Output is correct
13 Correct 18 ms 8840 KB Output is correct
14 Correct 18 ms 9048 KB Output is correct
15 Correct 19 ms 8796 KB Output is correct
16 Correct 13 ms 8540 KB Output is correct
17 Correct 14 ms 8536 KB Output is correct
18 Incorrect 11 ms 9956 KB Output isn't correct
19 Halted 0 ms 0 KB -