Submission #766188

#TimeUsernameProblemLanguageResultExecution timeMemory
766188birthdaycakeGrapevine (NOI22_grapevine)C++14
0 / 100
3070 ms13508 KiB
#ifndef _GLIBCXX_NO_ASSERT #include <cassert> #endif #include <cctype> #include <cerrno> #include <cfloat> #include <ciso646> #include <climits> #include <clocale> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdarg> #include <cstddef> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #if __cplusplus >= 201103L #include <ccomplex> #include <cfenv> #include <cinttypes> #include <cstdbool> #include <cstdint> #include <ctgmath> #include <cwchar> #include <cwctype> #endif #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <array> #include <atomic> #include <chrono> #include <condition_variable> #include <forward_list> #include <future> #include <initializer_list> #include <mutex> #include <random> #include <ratio> #include <regex> #include <scoped_allocator> #include <system_error> #include <thread> #include <tuple> #include <typeindex> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <fstream> #define endl '\n' #define int long long #define mod 1000000007 using namespace std; vector<pair<int,int>>adj[200001]; int grape[200001], ans = 1e18; int vs[200001]; void dfs(int x){ if(grape[x]) ans = min(ans, vs[x]); for(auto s: adj[x]){ if(!vs[s.first]){ vs[s.first] = vs[x] + s.second; dfs(s.first); } } } signed main(){ int n,q; cin >> n >> q; for(int i = 0; i < n - 1; i++){ int a,b,c; cin >> a >> b >> c; adj[a].push_back({b,c}); adj[b].push_back({a,c}); } for(int i = 0; i < q; i++){ int t; cin >> t; if(t == 1){ int s; cin >> s; vs[s] = 1; dfs(s); cout << ans - 1 << endl; ans = 1e18; for(int j = 1; j <= n; j++) vs[j] = 0; }else if(t == 2){ int v; cin >> v; grape[v] = !grape[v]; }else{ int a,b,c; cin >> a >> b >> c; for(int j = 0; j < adj[a].size(); j++){ if(adj[a][j].first == b) adj[a][j].second = c; } for(int j = 0; j < adj[b].size(); j++){ if(adj[b][j].first == a) adj[b][j].second = c; } } } }

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:125:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |             for(int j = 0; j < adj[a].size(); j++){
      |                            ~~^~~~~~~~~~~~~~~
Main.cpp:128:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |             for(int j = 0; j < adj[b].size(); j++){
      |                            ~~^~~~~~~~~~~~~~~
#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...