oj.uz

Submission #691655

# Submission time Handle Problem Language Result Execution time Memory
691655 2023-01-31T11:20:55 Z IUA_Hasin Intercastellar (JOI22_ho_t1) C++17
35 / 100
 2000 ms 3644 KB 
#include <bits/stdc++.h>

#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long

ll expo(ll n){
    ll count=0;
    while(n%2==0){
        count++;
        n/=2;
    }
    return count;
}

using namespace std;

int main ()
{
   ll n;
   cin>>n;
   ll arr[n];
   for (int i=0; i<n; i++){
    cin>>arr[i];
   }
   ll q;
   cin>>q;
   ll brr[q];
   for (int i=0; i<q; i++){
    cin>>brr[i];
   }

   ll crr[n];
   for (int i=0; i<n; i++){
    int x=expo(arr[i]);
    int y=pow(2,x);
    crr[i]=y;
   }

   for (int i=0; i<q; i++){
    ll coun=0;
    for (int j=0; j<n; j++){
        if (j==n-1){
            if (coun>=brr[i]){
                ll z=arr[n-2]/crr[n-2];
                cout << z << " ";
                break;
            } else {
                ll z=arr[n-1]/crr[n-1];
                cout << z << " ";
                break;

            }

        } else if (brr[i]>coun){
            coun+=crr[j];
        } else {
            ll z=arr[j-1]/crr[j-1];
            cout << z << " ";
            break;
        }
    }
   }



    return 0;


}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Execution timed out 2083 ms 3644 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 308 KB Output is correct
13 Correct 2 ms 212 KB Output is correct
14 Correct 2 ms 340 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Execution timed out 2083 ms 3644 KB Time limit exceeded
4 Halted 0 ms 0 KB -