oj.uz

답안 #337254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337254 2020-12-19T04:05:13 Z impri 다리 (APIO19_bridges) C++14
13 / 100
 3000 ms 9264 KB 
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> >graph[50001];
int ds[100001];
int visited[100001];
void dfs(int w,int cur){
visited[cur]=1;
for(int i=0;i<graph[cur].size();i++){
    if(!visited[graph[cur][i].first] && ds[graph[cur][i].second]>=w){
        dfs(w,graph[cur][i].first);
    }
}

}
int main(){
int n,m;
cin >> n >> m;
for(int i=1;i<=m;i++){
    int u,v,d;
    cin >> u >> v >> d;
    graph[u].push_back({v,i});
    graph[v].push_back({u,i});
    ds[i]=d;
}
int q;
cin >> q;
for(int i=1;i<=q;i++){
    int t,a,b;
    cin >> t >> a >> b;
    if(t==1){
        ds[a]=b;
    }
    else{
        memset(visited,0,sizeof(visited));
        dfs(b,a);
        int res=0;
        for(int j=1;j<=n;j++){
            if(visited[j])res++;
        }
        cout << res << '\n';
    }
}
}

Compilation message

bridges.cpp: In function 'void dfs(int, int)':
bridges.cpp:8:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | for(int i=0;i<graph[cur].size();i++){
      |             ~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 133 ms 2156 KB Output is correct
4 Correct 174 ms 2028 KB Output is correct
5 Correct 98 ms 2028 KB Output is correct
6 Correct 98 ms 2048 KB Output is correct
7 Correct 94 ms 2028 KB Output is correct
8 Correct 98 ms 2048 KB Output is correct
9 Correct 95 ms 2028 KB Output is correct
10 Correct 95 ms 2028 KB Output is correct
11 Correct 94 ms 2156 KB Output is correct
12 Correct 93 ms 2028 KB Output is correct
13 Correct 100 ms 2028 KB Output is correct
14 Correct 101 ms 2028 KB Output is correct
15 Correct 101 ms 2156 KB Output is correct
16 Correct 93 ms 2028 KB Output is correct
17 Correct 97 ms 2028 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2253 ms 8576 KB Output is correct
2 Correct 2281 ms 9088 KB Output is correct
3 Correct 2241 ms 8856 KB Output is correct
4 Correct 2439 ms 8940 KB Output is correct
5 Correct 2447 ms 9008 KB Output is correct
6 Execution timed out 3093 ms 7456 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2969 ms 5948 KB Output is correct
2 Execution timed out 3092 ms 3700 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3075 ms 9264 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2253 ms 8576 KB Output is correct
2 Correct 2281 ms 9088 KB Output is correct
3 Correct 2241 ms 8856 KB Output is correct
4 Correct 2439 ms 8940 KB Output is correct
5 Correct 2447 ms 9008 KB Output is correct
6 Execution timed out 3093 ms 7456 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 133 ms 2156 KB Output is correct
4 Correct 174 ms 2028 KB Output is correct
5 Correct 98 ms 2028 KB Output is correct
6 Correct 98 ms 2048 KB Output is correct
7 Correct 94 ms 2028 KB Output is correct
8 Correct 98 ms 2048 KB Output is correct
9 Correct 95 ms 2028 KB Output is correct
10 Correct 95 ms 2028 KB Output is correct
11 Correct 94 ms 2156 KB Output is correct
12 Correct 93 ms 2028 KB Output is correct
13 Correct 100 ms 2028 KB Output is correct
14 Correct 101 ms 2028 KB Output is correct
15 Correct 101 ms 2156 KB Output is correct
16 Correct 93 ms 2028 KB Output is correct
17 Correct 97 ms 2028 KB Output is correct
18 Correct 2253 ms 8576 KB Output is correct
19 Correct 2281 ms 9088 KB Output is correct
20 Correct 2241 ms 8856 KB Output is correct
21 Correct 2439 ms 8940 KB Output is correct
22 Correct 2447 ms 9008 KB Output is correct
23 Execution timed out 3093 ms 7456 KB Time limit exceeded
24 Halted 0 ms 0 KB -