oj.uz

Submission #703336

# Submission time Handle Problem Language Result Execution time Memory
703336 2023-02-27T05:49:11 Z niter Intercastellar (JOI22_ho_t1) C++14
25 / 100
 124 ms 3012 KB 
#include <bits/stdc++.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define STL(i, x) for(auto &i:x) cout << i << " "; cout << "\n";
using namespace std;

int a[200050], b[200050];
int qx[200050];

void db(){
    cout << "\n";
}
template<class T, class ...U>
void db(T XXX, U ...YYY){
    cout << XXX;  db(YYY...);
}

int main(){
    int n, q;
    cin >> n;
    loop(i,0,n){
        cin >> a[i];
        b[i] = a[i];
    }
    cin >> q;
    //db("q = ", q);
    loop(i,0,q){
        cin >> qx[i];
    }
    int now_i = 0;
    long long sum = 0, cnt;
    loop(i,0,n){
        cnt = 1;
        while(!(b[i] & 1)){
            b[i] >>= 1;
            cnt <<= 1;
        }
        sum += cnt;
        while(true){
            if(now_i == q)
                return 0;
            if(qx[now_i] <= sum){
                cout << b[i] << "\n";
                now_i++;
            }
            else break;
        }
    }
    return 0;
}
/*
4
14 9 8 12
6
2 3 5 7 11 13
*/

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 47 ms 2012 KB Output is correct
4 Correct 57 ms 1532 KB Output is correct
5 Correct 95 ms 3012 KB Output is correct
6 Correct 54 ms 2152 KB Output is correct
7 Correct 97 ms 2976 KB Output is correct
8 Correct 124 ms 2976 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 47 ms 2012 KB Output is correct
4 Correct 57 ms 1532 KB Output is correct
5 Correct 95 ms 3012 KB Output is correct
6 Correct 54 ms 2152 KB Output is correct
7 Correct 97 ms 2976 KB Output is correct
8 Correct 124 ms 2976 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -