제출 #473311

#제출 시각아이디문제언어결과실행 시간메모리
473311_L__Usmjeri (COCI17_usmjeri)C++17
0 / 140
201 ms3248 KiB
// This code is written by _L__ #include <bits/stdc++.h> using namespace std; #define endl '\n' #define F_word ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); typedef long long ll; typedef long double ld; const int mod = 1e9+7, N = 2e5+13, inf = 1e9+1; const ld E = 1e-6; #define ff first #define ss second ll fast(ll base, ll power){ ll ans = 1; while(power >0){ if(power%2){ ans = (ans*base)%mod; } base = (base*base)%mod; power /= 2; } return ans; } int main(void){ F_word; ll n, m; cin >> n >> m; for(int i = 1; i < n; ++i){int x, y; cin >> x >> y;} for(int i = 0; i < m; ++i){ ll x, y; cin >> x >> y; if(x < y) swap(x, y); ll z = (y-1)+(n-x); cout << fast(2,z+1) << endl; } }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...