| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1283088 | vibeduck | Intercastellar (JOI22_ho_t1) | C++20 | 50 ms | 5336 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
pii find(int x) {
if (x % 2) return {x, 1};
pii x2 = find(x/2);
return {x2.fi, x2.se * 2};
}
inline void solve() {
int n; cin >> n;
vi a(n); for (int i = 0; i < n; i++) cin >> a[i];
vi pref(n + 1); for (int i = 1; i <= n; i++) pref[i] = pref[i - 1] + find(a[i - 1]).se;
int q; cin >> q; int ptr = 0;
while (q--) {
int x; cin >> x; x--;
while (ptr <= n && pref[ptr] <= x) ptr++;
int y = x - pref[ptr - 1];
if (y) cout << find(a[ptr - 1]).fi << '\n';
else cout << find(a[ptr - 1]).fi << '\n';
}
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
