Submission #568688

#TimeUsernameProblemLanguageResultExecution timeMemory
568688almothana05Bridges (APIO19_bridges)C++14
13 / 100
3075 ms14916 KiB
#include<bits/stdc++.h> #define mod 1000000007 #define inf 10000000000000000 using namespace std; vector<vector<int> >edge; vector<pair<int , int> >gr[100000]; int erg , vis[100000]; void dfs(int x , int cmp){ // cout << x << ' ' << erg << "\n"; vis[x] = 1; erg++; for(int i = 0 ; i < gr[x].size() ; i++){ int kind = gr[x][i].first , val = gr[x][i].second; // cout << x << ' ' << kind << ' ' << val << "\n"; if(vis[kind] == 0 && val >= cmp){ dfs(kind , cmp); } } } int main(){ // ios_base::sync_with_stdio(false); // cin.tie(NULL); int menge , numm , nummer , ed , cmp , comp ;; cin >> menge >> ed; for(int i = 0 ; i < ed ; i++){ cin >> numm >> nummer >> cmp; gr[numm].push_back({nummer , cmp}); gr[nummer].push_back({numm , cmp}); edge.push_back({numm , gr[numm].size() - 1 , nummer , gr[nummer].size() - 1}); } int que; cin >> que; while(que--){ // cout << "ja\n"; cin >> numm; if(numm == 1){ cin >> numm >> nummer; numm--; gr[edge[numm][0]][edge[numm][1]].second = nummer; gr[edge[numm][2]][edge[numm][3]].second = nummer; // cout << *edge[numm].first << "\n"; // for(int i = 0 ; i < gr[1].size() ; i++){ // cout << gr[1][i].second << ' '; // } // cout << "\n"; } else{ cin >> numm >> nummer; erg = 0; dfs(numm , nummer); cout << erg << "\n"; for(int i = 0 ; i <= menge ; i++){ vis[i] = 0; } } } }

Compilation message (stderr)

bridges.cpp: In function 'void dfs(int, int)':
bridges.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |    for(int i = 0 ; i < gr[x].size() ; i++){
      |                    ~~^~~~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:30:46: warning: narrowing conversion of '(gr[numm].std::vector<std::pair<int, int> >::size() - 1)' from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   30 |       edge.push_back({numm , gr[numm].size() - 1 , nummer , gr[nummer].size() - 1});
      |                              ~~~~~~~~~~~~~~~~^~~
bridges.cpp:30:46: warning: narrowing conversion of '(gr[numm].std::vector<std::pair<int, int> >::size() - 1)' from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
bridges.cpp:30:79: warning: narrowing conversion of '(gr[nummer].std::vector<std::pair<int, int> >::size() - 1)' from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   30 |       edge.push_back({numm , gr[numm].size() - 1 , nummer , gr[nummer].size() - 1});
      |                                                             ~~~~~~~~~~~~~~~~~~^~~
bridges.cpp:30:79: warning: narrowing conversion of '(gr[nummer].std::vector<std::pair<int, int> >::size() - 1)' from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
bridges.cpp:24:43: warning: unused variable 'comp' [-Wunused-variable]
   24 |    int menge , numm , nummer , ed , cmp , comp ;;
      |                                           ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...