Submission #829617

#TimeUsernameProblemLanguageResultExecution timeMemory
829617tolbiDuathlon (APIO18_duathlon)C++17
0 / 100
1114 ms1048576 KiB
#pragma optimize("Bismillahirrahmanirrahim") //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█■█ //█─█─█▄─█▄─█─█─█─█ //Allahuekber //ahmet23 orz... //FatihSultanMehmedHan //YavuzSultanSelimHan //AbdulhamidHan //Sani buyuk Osman Pasa Plevneden cikmam diyor #define author tolbi #include <bits/stdc++.h> using namespace std; #define deci(x) int x;cin>>x; #define decstr(x) string x;cin>>x; #define sortarr(x) sort(x.begin(), x.end()) #define sortrarr(x) sort(x.rbegin(), x.rend()) #define rev(x) reverse(x.begin(), x.end()) #define cinarr(x) for (auto &it : x) cin>>it; #define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl; #define tol(bi) (1LL<<((int)(bi))) #define endl '\n' #define int long long mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count()); int32_t main(){ int T = 1; int tno = 0; while (T-(tno++)){ deci(n);deci(m); vector<vector<int>> arr(n); for (int i = 0; i < m; ++i) { deci(u);deci(v); arr[u-1].push_back(v-1); arr[v-1].push_back(u-1); } vector<int> subsz(n); int ans = 0; auto f = [&](int node, int lnode, auto f)->void{ subsz[node]=1; for (int i = 0; i < arr[node].size(); i++){ if (arr[node][i]==lnode) continue; f(arr[node][i],node,f); ans+=subsz[arr[node][i]]*(n-subsz[arr[node][i]]-1); subsz[node]+=subsz[arr[node][i]]; } ans+=(subsz[node]-1)*(n-subsz[node]); }; f(0,-1,f); cout<<ans<<endl; } }

Compilation message (stderr)

count_triplets.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
count_triplets.cpp: In instantiation of 'main()::<lambda(long long int, long long int, auto:23)> [with auto:23 = main()::<lambda(long long int, long long int, auto:23)>]':
count_triplets.cpp:49:17:   required from here
count_triplets.cpp:41:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             for (int i = 0; i < arr[node].size(); i++){
      |                             ~~^~~~~~~~~~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...