oj.uz

답안 #993541

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
993541 2024-06-06T02:41:14 Z modwwe Intercastellar (JOI22_ho_t1) C++17
100 / 100
 49 ms 7764 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int mod2=998244353;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e,f;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
    ///fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    ///modwwe
    phongbeo();
}
int a[200001];
void phongbeo()
{
      cin>>n;
for(int i=1;i<=n;i++)
{
    cin>>a[i];
}
cin>>m;
int j=0;
 s2=0;
 s3=0;
 for(int i=1;i<=m;i++)
 {
     cin>>l;
      if(l>s2)
      {
          while(l>s2)
          { ++j;
               s2=s2+(a[j]&-a[j]);
                         }
          s3=a[j]/(a[j]&-a[j]);
           cout<<s3,down
      }
      else
      {
          cout<<s3,down
      }
 }
}

Compilation message

Main.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 11 ms 2652 KB Output is correct
4 Correct 17 ms 2140 KB Output is correct
5 Correct 29 ms 3932 KB Output is correct
6 Correct 17 ms 2896 KB Output is correct
7 Correct 30 ms 3920 KB Output is correct
8 Correct 28 ms 4188 KB Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 11 ms 2652 KB Output is correct
4 Correct 17 ms 2140 KB Output is correct
5 Correct 29 ms 3932 KB Output is correct
6 Correct 17 ms 2896 KB Output is correct
7 Correct 30 ms 3920 KB Output is correct
8 Correct 28 ms 4188 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 19 ms 2936 KB Output is correct
24 Correct 23 ms 4176 KB Output is correct
25 Correct 40 ms 7252 KB Output is correct
26 Correct 27 ms 4692 KB Output is correct
27 Correct 23 ms 4444 KB Output is correct
28 Correct 49 ms 7764 KB Output is correct
29 Correct 42 ms 7252 KB Output is correct
30 Correct 25 ms 3668 KB Output is correct
31 Correct 43 ms 7508 KB Output is correct