oj.uz

답안 #882448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882448 2023-12-03T08:05:40 Z vjudge1 Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 1000 ms 86208 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int32_t main(){
	ios;
	int t=1;
	int tno = 0;
	if (!t) cin>>t;
	while (t-(tno++)){
		deci(n);deci(a);deci(b);
		vint(arr(n));
		cinarr(arr);
		vector<int> pref = arr;
		for (int i = 1; i < n; i++){
			pref[i]+=pref[i-1];
		}
		function<int(int,int)> query = [&](int l, int r)->int{
			int hh = 0;
			if (l) hh = pref[l-1];
			return pref[r]-hh;
		};
		int rans = 0;
		int ans = 0;
		vector<vector<bool>> vis(n+1,vector<bool>(n+1,false));
		vector<vector<bitset<2000>>> dp(n+1,vector<bitset<2000>>(n+1));
		function<void(int,int)> f = [&](int l, int r)->void{
			if (r>=n){
				if (l==r){
					for (int i = a; i <= b; i++) dp[l][r].set(i,1);
				}
				return;
			}
			if (vis[l][r]) return;
			vis[l][r]=true;
			f(l,r+1);
			dp[l][r]=dp[l][r+1];
			if (!(query(l,r)&rans)){
				f(r+1,r+1);
				dp[l][r]|=dp[r+1][r+1]>>1;
			}
		};
		int LOG = 60;
		for (int bit = LOG-1; bit >= 0; bit--){
			for (int i = 0; i <= n; ++i)
			{
				for (int j = 0; j <= n; ++j){
					dp[i][j]=bitset<2000>();
					vis[i][j]=false;
				}
			}
			ans+=tol(bit);
			rans+=tol(bit);
			f(0,0);
			if (dp[0][0][0]) ans-=tol(bit);
			else rans-=tol(bit);
		}
		cout<<ans<<endl;
	}
}

Compilation message

sculpture.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      |

Subtask #1
9.0 / 9.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 7 ms 860 KB Output is correct
17 Correct 8 ms 960 KB Output is correct
18 Correct 14 ms 1116 KB Output is correct
19 Correct 11 ms 1116 KB Output is correct
20 Correct 11 ms 1112 KB Output is correct
21 Correct 11 ms 1116 KB Output is correct
22 Correct 11 ms 1112 KB Output is correct
23 Correct 17 ms 1112 KB Output is correct
24 Correct 12 ms 1116 KB Output is correct
25 Correct 18 ms 1372 KB Output is correct
26 Correct 27 ms 1884 KB Output is correct
27 Correct 36 ms 2652 KB Output is correct
28 Correct 43 ms 2904 KB Output is correct
29 Correct 43 ms 2908 KB Output is correct
30 Correct 44 ms 3084 KB Output is correct
31 Correct 43 ms 2908 KB Output is correct
32 Correct 49 ms 3096 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 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 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 2 ms 600 KB Output is correct
32 Correct 2 ms 584 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 2 ms 344 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 3 ms 348 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 7 ms 876 KB Output is correct
40 Correct 8 ms 860 KB Output is correct
41 Correct 11 ms 1128 KB Output is correct
42 Correct 11 ms 1112 KB Output is correct
43 Correct 12 ms 1116 KB Output is correct
44 Correct 11 ms 1116 KB Output is correct
45 Correct 12 ms 1156 KB Output is correct
46 Correct 15 ms 1160 KB Output is correct
47 Correct 12 ms 1112 KB Output is correct
48 Correct 20 ms 1608 KB Output is correct
49 Correct 26 ms 1880 KB Output is correct
50 Correct 36 ms 2648 KB Output is correct
51 Correct 44 ms 2908 KB Output is correct
52 Correct 44 ms 2908 KB Output is correct
53 Correct 48 ms 2908 KB Output is correct
54 Correct 43 ms 2904 KB Output is correct
55 Correct 50 ms 2904 KB Output is correct
56 Correct 10 ms 1112 KB Output is correct
57 Correct 26 ms 1884 KB Output is correct
58 Correct 28 ms 2652 KB Output is correct
59 Correct 34 ms 2908 KB Output is correct
60 Correct 39 ms 2904 KB Output is correct
61 Correct 33 ms 2908 KB Output is correct
62 Correct 35 ms 2908 KB Output is correct
63 Correct 36 ms 2904 KB Output is correct
64 Correct 36 ms 2392 KB Output is correct
65 Correct 9 ms 1112 KB Output is correct
66 Correct 15 ms 1608 KB Output is correct
67 Correct 23 ms 2080 KB Output is correct
68 Correct 28 ms 2648 KB Output is correct
69 Correct 34 ms 3116 KB Output is correct
70 Correct 34 ms 2908 KB Output is correct
71 Correct 34 ms 2908 KB Output is correct
72 Correct 42 ms 2908 KB Output is correct
73 Correct 39 ms 2904 KB Output is correct
74 Correct 37 ms 2912 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 4 ms 380 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 7 ms 860 KB Output is correct
27 Correct 9 ms 860 KB Output is correct
28 Correct 14 ms 1116 KB Output is correct
29 Correct 11 ms 1152 KB Output is correct
30 Correct 12 ms 1156 KB Output is correct
31 Correct 14 ms 1116 KB Output is correct
32 Correct 13 ms 1116 KB Output is correct
33 Correct 11 ms 1116 KB Output is correct
34 Correct 13 ms 1176 KB Output is correct
35 Correct 19 ms 1608 KB Output is correct
36 Correct 30 ms 1884 KB Output is correct
37 Correct 36 ms 2652 KB Output is correct
38 Correct 48 ms 3084 KB Output is correct
39 Correct 44 ms 2908 KB Output is correct
40 Correct 51 ms 3160 KB Output is correct
41 Correct 43 ms 2908 KB Output is correct
42 Correct 43 ms 2904 KB Output is correct
43 Correct 9 ms 1112 KB Output is correct
44 Correct 22 ms 1880 KB Output is correct
45 Correct 28 ms 2652 KB Output is correct
46 Correct 34 ms 2908 KB Output is correct
47 Correct 38 ms 3100 KB Output is correct
48 Correct 34 ms 2908 KB Output is correct
49 Correct 35 ms 3112 KB Output is correct
50 Correct 35 ms 2908 KB Output is correct
51 Correct 35 ms 2908 KB Output is correct
52 Execution timed out 1041 ms 86208 KB Time limit exceeded
53 Halted 0 ms 0 KB -