Submission #1084618

#TimeUsernameProblemLanguageResultExecution timeMemory
1084618shiocanPrize (CEOI22_prize)C++17
0 / 100
187 ms5308 KiB
#include <bits/stdc++.h> #include <cstdlib> #include <stdlib.h> using namespace std; /* #define cin fin #define cout fout string __fname = ""; ifstream fin(__fname + ".in"); ofstream fout(__fname + ".out"); */ #define ull unsigned long long #define ll long long // #define int long long #define pii pair<int, int> #define all(v) v.begin(), v.end() int mod = 1e9 + 7; // const int inf = 1e18; const int N = 1e6 + 10; void solve(){ int n, k, q, t; cin >> n >> k >> q >> t; vector<int> ans(n + 5, 0ll); int root = -1; for(int i = 1; i <= n; i++){ int x; cin >> x; if(x == -1) root = i; } for(int i = 1; i <= n; i++){ int x; cin >> x; } vector<int> aux; // size q aux.push_back(root); cout << root << ' '; k--; for(int i = 1; i <= n && k; i++){ if(i != root) cout << i << ' ', k--, aux.push_back(i); } cout << endl; for(int i = 1; i <= q; i++) cout << "? " << root << ' ' << aux[i] << endl; cout << "!" << endl; for(int i = 1; i <= q; i++){ int x; cin >> x >> x >> x >> x; ans[aux[i]] = x; } vector<int> res(t + 5, 0ll); for(int i = 1; i <= t; i++){ int x, y; cin >> x >> y; res[i] = ans[x] + ans[y]; } for(int i = 1; i <= t; i++) cout << res[i] << ' ' << res[i] << endl; } int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t = 1; // cin >> t; while(t--) solve(); return 0; }
#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...