oj.uz

답안 #1091230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091230 2024-09-20T07:54:07 Z modwwe Bali Sculptures (APIO15_sculpture) C++17
100 / 100
 55 ms 600 KB 
//#include "game.h"
//#pragma GCC optimize("conserve-stack")
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#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".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while(c<'0'||c>'9')
    {
        c=getchar_unlocked();
    }
    while(c>='0'&&c<='9')
    {
        x=(x<<1)+(x<<3)+c-'0';
        c=getchar_unlocked();
    }
    return x;
}

void phongbeo();
const int inf=1e9;
const int mod2=1e9+9;
const int  mod1=998244353;
struct icd
{
    long double a;
    int 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;

};

int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2,center;
int  i,s10,s12;
int kk;
int el=19;

main()
{
#ifndef ONLINE_JUDGE
    //fin(task);
    //fou(task);
#endif
    NHP
    /// cin>>s1;
///modwwe
    phongbeo(),down
    // checktime
}
int a[2001];
namespace sub3
{
    bool dp[101][101];
    bool  check(int x)
    {
         memset(dp,0,sizeof dp);
         dp[0][0]=1;
         for(int i=1;i<=n;i++)
             for(int j=0;j<i;j++){
                    if(a[i]-a[j]>x) continue;
             for(int z=1;z<=i;z++)
                if(dp[j][z-1])
             if(((a[i]-a[j])&x)==a[i]-a[j])
               dp[i][z]=1;}
         for(int i=l;i<=r;i++)
            if(dp[n][i])
             return 1;
          return 0;
    }
    void solve()
    {
        for(int i=1; i<=n; i++)
            cin>>a[i];
            s2=(1ll<<40)-1;
            for(int i=1;i<=n;i++)
                a[i]+=a[i-1];
        for(int i=39; i>=0; --i)
        {
            if(!bit(s2,1ll*i)) continue;
            if(check(s2-(1ll<<i)))
                s2-=(1ll<<i);
        }
        cout<<s2,down
    }
};
namespace sub4{
int dp[2001];
 bool check(int x)
  {
       for(int i=1;i<=n;i++)
         dp[i]=n+1;

        for(int i=1;i<=n;i++)
             for(int j=0;j<=i-1;j++)
             { if(a[i]-a[j]>x) continue;
             if(((a[i]-a[j])&x)==a[i]-a[j])
             dp[i]=min(dp[j]+1,dp[i]);
             }
         return dp[n]<=r;
  }
 void solve()
  {
  s2=0;
        for(int i=1; i<=n; i++)
            cin>>a[i];
                        s2=(1ll<<41)-1;

                  for(int i=1;i<=n;i++){
                a[i]+=a[i-1];
                }
        for(int i=40; i>=0; --i)
        {
            if(!bit(s2,i)) continue;
            if(check(s2-(1ll<<i)))
                s2-=(1ll<<i);
        }
        cout<<s2,down
  }
};
void phongbeo()
{
    cin>>n;
     cin>>l>>r;
      if(n<=100) sub3::solve();
      else sub4::solve();
}

Compilation message

sculpture.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
sculpture.cpp: In function 'void sub3::solve()':
sculpture.cpp:104:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  104 |         for(int i=1; i<=n; i++)
      |         ^~~
sculpture.cpp:106:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  106 |             s2=(1ll<<40)-1;
      |             ^~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 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 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 5 ms 348 KB Output is correct
27 Correct 7 ms 472 KB Output is correct
28 Correct 8 ms 348 KB Output is correct
29 Correct 9 ms 472 KB Output is correct
30 Correct 10 ms 348 KB Output is correct
31 Correct 8 ms 348 KB Output is correct
32 Correct 8 ms 472 KB Output is correct

Subtask #4
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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 352 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 0 ms 356 KB Output is correct
18 Correct 0 ms 352 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 356 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 356 KB Output is correct
26 Correct 1 ms 352 KB Output is correct
27 Correct 0 ms 352 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 472 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 2 ms 348 KB Output is correct
44 Correct 2 ms 348 KB Output is correct
45 Correct 2 ms 348 KB Output is correct
46 Correct 2 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 3 ms 348 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Correct 8 ms 348 KB Output is correct
51 Correct 8 ms 480 KB Output is correct
52 Correct 9 ms 472 KB Output is correct
53 Correct 9 ms 344 KB Output is correct
54 Correct 10 ms 476 KB Output is correct
55 Correct 8 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 2 ms 348 KB Output is correct
58 Correct 3 ms 348 KB Output is correct
59 Correct 2 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 3 ms 348 KB Output is correct
63 Correct 3 ms 348 KB Output is correct
64 Correct 7 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 2 ms 348 KB Output is correct
69 Correct 3 ms 344 KB Output is correct
70 Correct 2 ms 360 KB Output is correct
71 Correct 2 ms 476 KB Output is correct
72 Correct 3 ms 348 KB Output is correct
73 Correct 4 ms 348 KB Output is correct
74 Correct 3 ms 468 KB Output is correct

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 356 KB Output is correct
32 Correct 1 ms 360 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 360 KB Output is correct
35 Correct 3 ms 476 KB Output is correct
36 Correct 5 ms 356 KB Output is correct
37 Correct 10 ms 356 KB Output is correct
38 Correct 8 ms 356 KB Output is correct
39 Correct 9 ms 356 KB Output is correct
40 Correct 9 ms 472 KB Output is correct
41 Correct 8 ms 360 KB Output is correct
42 Correct 8 ms 356 KB Output is correct
43 Correct 1 ms 356 KB Output is correct
44 Correct 2 ms 352 KB Output is correct
45 Correct 2 ms 360 KB Output is correct
46 Correct 2 ms 352 KB Output is correct
47 Correct 2 ms 360 KB Output is correct
48 Correct 2 ms 356 KB Output is correct
49 Correct 3 ms 348 KB Output is correct
50 Correct 3 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 5 ms 348 KB Output is correct
53 Correct 8 ms 476 KB Output is correct
54 Correct 17 ms 348 KB Output is correct
55 Correct 23 ms 344 KB Output is correct
56 Correct 42 ms 344 KB Output is correct
57 Correct 46 ms 344 KB Output is correct
58 Correct 40 ms 348 KB Output is correct
59 Correct 40 ms 344 KB Output is correct
60 Correct 55 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 7 ms 476 KB Output is correct
63 Correct 14 ms 480 KB Output is correct
64 Correct 11 ms 484 KB Output is correct
65 Correct 21 ms 344 KB Output is correct
66 Correct 31 ms 348 KB Output is correct
67 Correct 46 ms 348 KB Output is correct
68 Correct 49 ms 348 KB Output is correct
69 Correct 41 ms 348 KB Output is correct