oj.uz

Submission #429076

# Submission time Handle Problem Language Result Execution time Memory
429076 2021-06-15T17:13:20 Z amunduzbaev Lamps (JOI19_lamps) C++14
47 / 100
 13 ms 14716 KB 
/* made by amunduzbaev */
 
#include "bits/stdc++.h"
 
using namespace std;
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
//~ using namespace __gnu_pbds;
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update>;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
#define degub(x) cout<<#x<<" : "<<x<<"\n"
#define GG cout<<"here"<<endl;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
 
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, s, t, q, ans, res, a[N];
int dp[N][2][2][2], b[N];

void solve(int t_case){
	cin>>n;
	for(int i=1;i<=n;i++) { char c; cin>>c; a[i] = c - '0'; }
	for(int i=1;i<=n;i++) { char c; cin>>c; b[i] = c - '0'; }
	mem(dp, 127);
	dp[0][0][0][0] = 0;
	for(int i=1;i<=n;i++){
		for(int a0=0;a0<2;a0++){
			for(int a1=0;a1<2;a1++){
				for(int a2=0;a2<2;a2++){
					int x = a[i];
					if(a0) x = 0;
					if(a1) x = 1;
					if(a2) x ^= 1;
					if(x != b[i]) continue;
					for(int A0=0;A0<2;A0++){
						for(int A1=0;A1<2;A1++){
							for(int A2=0;A2<2;A2++){
								umin(dp[i][a0][a1][a2], dp[i-1][A0][A1][A2] + (a0 > A0) + (a1 > A1) + (a2 > A2));
							}
						}	
					}
				}
			}
		}
	} 
	res = inf;
	for(int a0=0;a0<2;a0++){
		for(int a1=0;a1<2;a1++){
			for(int a2=0;a2<2;a2++){
				umin(res, dp[n][a0][a1][a2]);
			}
		}
	} cout<<res<<"\n";
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

lamp.cpp: In function 'void usaco(std::string)':
lamp.cpp:38:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lamp.cpp:39:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12748 KB Output is correct
2 Correct 6 ms 12748 KB Output is correct
3 Correct 6 ms 12740 KB Output is correct
4 Correct 6 ms 12748 KB Output is correct
5 Correct 7 ms 12748 KB Output is correct
6 Correct 7 ms 12808 KB Output is correct
7 Correct 8 ms 12760 KB Output is correct
8 Correct 7 ms 12748 KB Output is correct
9 Correct 6 ms 12748 KB Output is correct
10 Correct 6 ms 12740 KB Output is correct
11 Correct 6 ms 12768 KB Output is correct
12 Correct 6 ms 12748 KB Output is correct
13 Correct 6 ms 12820 KB Output is correct
14 Correct 8 ms 12748 KB Output is correct
15 Correct 7 ms 12748 KB Output is correct
16 Correct 6 ms 12764 KB Output is correct
17 Correct 6 ms 12748 KB Output is correct
18 Correct 6 ms 12748 KB Output is correct
19 Correct 6 ms 12748 KB Output is correct
20 Correct 7 ms 12748 KB Output is correct
21 Correct 6 ms 12764 KB Output is correct
22 Correct 13 ms 12748 KB Output is correct
23 Correct 6 ms 12748 KB Output is correct
24 Correct 6 ms 12748 KB Output is correct
25 Correct 6 ms 12748 KB Output is correct
26 Correct 6 ms 12748 KB Output is correct
27 Correct 6 ms 12772 KB Output is correct
28 Correct 6 ms 12748 KB Output is correct
29 Correct 8 ms 12876 KB Output is correct
30 Correct 6 ms 12736 KB Output is correct
31 Correct 8 ms 12860 KB Output is correct
32 Correct 6 ms 12748 KB Output is correct
33 Correct 6 ms 12748 KB Output is correct
34 Correct 6 ms 12748 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12748 KB Output is correct
2 Correct 6 ms 12748 KB Output is correct
3 Correct 6 ms 12740 KB Output is correct
4 Correct 6 ms 12748 KB Output is correct
5 Correct 7 ms 12748 KB Output is correct
6 Correct 7 ms 12808 KB Output is correct
7 Correct 8 ms 12760 KB Output is correct
8 Correct 7 ms 12748 KB Output is correct
9 Correct 6 ms 12748 KB Output is correct
10 Correct 6 ms 12740 KB Output is correct
11 Correct 6 ms 12768 KB Output is correct
12 Correct 6 ms 12748 KB Output is correct
13 Correct 6 ms 12820 KB Output is correct
14 Correct 8 ms 12748 KB Output is correct
15 Correct 7 ms 12748 KB Output is correct
16 Correct 6 ms 12764 KB Output is correct
17 Correct 6 ms 12748 KB Output is correct
18 Correct 6 ms 12748 KB Output is correct
19 Correct 6 ms 12748 KB Output is correct
20 Correct 7 ms 12748 KB Output is correct
21 Correct 6 ms 12764 KB Output is correct
22 Correct 13 ms 12748 KB Output is correct
23 Correct 6 ms 12748 KB Output is correct
24 Correct 6 ms 12748 KB Output is correct
25 Correct 6 ms 12748 KB Output is correct
26 Correct 6 ms 12748 KB Output is correct
27 Correct 6 ms 12772 KB Output is correct
28 Correct 6 ms 12748 KB Output is correct
29 Correct 8 ms 12876 KB Output is correct
30 Correct 6 ms 12736 KB Output is correct
31 Correct 8 ms 12860 KB Output is correct
32 Correct 6 ms 12748 KB Output is correct
33 Correct 6 ms 12748 KB Output is correct
34 Correct 6 ms 12748 KB Output is correct
35 Correct 6 ms 12860 KB Output is correct
36 Correct 7 ms 12876 KB Output is correct
37 Correct 7 ms 12836 KB Output is correct
38 Correct 9 ms 12812 KB Output is correct
39 Correct 9 ms 12876 KB Output is correct
40 Correct 7 ms 12876 KB Output is correct
41 Correct 8 ms 12876 KB Output is correct
42 Correct 7 ms 12872 KB Output is correct
43 Correct 7 ms 12868 KB Output is correct
44 Correct 6 ms 12804 KB Output is correct
45 Correct 7 ms 12824 KB Output is correct
46 Correct 7 ms 12876 KB Output is correct
47 Correct 7 ms 12876 KB Output is correct
48 Correct 7 ms 12876 KB Output is correct
49 Correct 7 ms 12876 KB Output is correct
50 Correct 7 ms 12876 KB Output is correct
51 Correct 7 ms 12868 KB Output is correct
52 Correct 8 ms 12876 KB Output is correct
53 Correct 7 ms 12876 KB Output is correct
54 Correct 7 ms 12892 KB Output is correct
55 Correct 7 ms 12876 KB Output is correct
56 Correct 8 ms 12876 KB Output is correct
57 Correct 8 ms 12876 KB Output is correct
58 Correct 7 ms 12876 KB Output is correct

Subtask #3
0 / 4.0

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

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12748 KB Output is correct
2 Correct 6 ms 12748 KB Output is correct
3 Correct 6 ms 12740 KB Output is correct
4 Correct 6 ms 12748 KB Output is correct
5 Correct 7 ms 12748 KB Output is correct
6 Correct 7 ms 12808 KB Output is correct
7 Correct 8 ms 12760 KB Output is correct
8 Correct 7 ms 12748 KB Output is correct
9 Correct 6 ms 12748 KB Output is correct
10 Correct 6 ms 12740 KB Output is correct
11 Correct 6 ms 12768 KB Output is correct
12 Correct 6 ms 12748 KB Output is correct
13 Correct 6 ms 12820 KB Output is correct
14 Correct 8 ms 12748 KB Output is correct
15 Correct 7 ms 12748 KB Output is correct
16 Correct 6 ms 12764 KB Output is correct
17 Correct 6 ms 12748 KB Output is correct
18 Correct 6 ms 12748 KB Output is correct
19 Correct 6 ms 12748 KB Output is correct
20 Correct 7 ms 12748 KB Output is correct
21 Correct 6 ms 12764 KB Output is correct
22 Correct 13 ms 12748 KB Output is correct
23 Correct 6 ms 12748 KB Output is correct
24 Correct 6 ms 12748 KB Output is correct
25 Correct 6 ms 12748 KB Output is correct
26 Correct 6 ms 12748 KB Output is correct
27 Correct 6 ms 12772 KB Output is correct
28 Correct 6 ms 12748 KB Output is correct
29 Correct 8 ms 12876 KB Output is correct
30 Correct 6 ms 12736 KB Output is correct
31 Correct 8 ms 12860 KB Output is correct
32 Correct 6 ms 12748 KB Output is correct
33 Correct 6 ms 12748 KB Output is correct
34 Correct 6 ms 12748 KB Output is correct
35 Correct 6 ms 12860 KB Output is correct
36 Correct 7 ms 12876 KB Output is correct
37 Correct 7 ms 12836 KB Output is correct
38 Correct 9 ms 12812 KB Output is correct
39 Correct 9 ms 12876 KB Output is correct
40 Correct 7 ms 12876 KB Output is correct
41 Correct 8 ms 12876 KB Output is correct
42 Correct 7 ms 12872 KB Output is correct
43 Correct 7 ms 12868 KB Output is correct
44 Correct 6 ms 12804 KB Output is correct
45 Correct 7 ms 12824 KB Output is correct
46 Correct 7 ms 12876 KB Output is correct
47 Correct 7 ms 12876 KB Output is correct
48 Correct 7 ms 12876 KB Output is correct
49 Correct 7 ms 12876 KB Output is correct
50 Correct 7 ms 12876 KB Output is correct
51 Correct 7 ms 12868 KB Output is correct
52 Correct 8 ms 12876 KB Output is correct
53 Correct 7 ms 12876 KB Output is correct
54 Correct 7 ms 12892 KB Output is correct
55 Correct 7 ms 12876 KB Output is correct
56 Correct 8 ms 12876 KB Output is correct
57 Correct 8 ms 12876 KB Output is correct
58 Correct 7 ms 12876 KB Output is correct
59 Correct 6 ms 12736 KB Output is correct
60 Correct 7 ms 12748 KB Output is correct
61 Correct 7 ms 12748 KB Output is correct
62 Correct 7 ms 12748 KB Output is correct
63 Correct 6 ms 12748 KB Output is correct
64 Correct 7 ms 12876 KB Output is correct
65 Correct 10 ms 14716 KB Output is correct
66 Incorrect 10 ms 14696 KB Output isn't correct
67 Halted 0 ms 0 KB -