oj.uz

답안 #527103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527103 2022-02-17T01:59:36 Z pavement Intercastellar (JOI22_ho_t1) C++17
100 / 100
 77 ms 9088 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, Q, ptr, curr, A, OA, X;
vector<ii> vec;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> A;
		OA = A;
		while (A & 1 ^ 1) A >>= 1;
		vec.eb(OA / A, A);	
	}
	cin >> Q;
	for (int i = 1; i <= Q; i++) {
		cin >> X;
		while (vec[ptr].first + curr < X) {
			curr += vec[ptr].first;
			ptr++;
		}
		cout << vec[ptr].second << '\n';
	}
}

Compilation message

Main.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:38:12: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   38 |   while (A & 1 ^ 1) A >>= 1;
      |          ~~^~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 20 ms 4792 KB Output is correct
4 Correct 29 ms 2304 KB Output is correct
5 Correct 48 ms 5036 KB Output is correct
6 Correct 26 ms 5036 KB Output is correct
7 Correct 42 ms 5196 KB Output is correct
8 Correct 45 ms 5608 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 20 ms 4792 KB Output is correct
4 Correct 29 ms 2304 KB Output is correct
5 Correct 48 ms 5036 KB Output is correct
6 Correct 26 ms 5036 KB Output is correct
7 Correct 42 ms 5196 KB Output is correct
8 Correct 45 ms 5608 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 24 ms 3012 KB Output is correct
24 Correct 33 ms 5628 KB Output is correct
25 Correct 74 ms 8148 KB Output is correct
26 Correct 41 ms 5320 KB Output is correct
27 Correct 38 ms 5672 KB Output is correct
28 Correct 70 ms 9088 KB Output is correct
29 Correct 68 ms 8108 KB Output is correct
30 Correct 37 ms 3724 KB Output is correct
31 Correct 77 ms 8904 KB Output is correct