oj.uz

Submission #937758

# Submission time Handle Problem Language Result Execution time Memory
937758 2024-03-04T12:40:56 Z wojciech_domin2 Lamps (JOI19_lamps) C++14
47 / 100
 1000 ms 127836 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ins insert
#define fi first
#define se second
#define debug(x) cout<<#x<<" = "<<x<<"\n";

using namespace std;
using ll = long long;
using ld = long double;

template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.fi<<", "<<m.se<<")";
}
 
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}

const int MAX_N = 1000020;
const int INF = 213721372;
char A[MAX_N];
char B[MAX_N];
int dp[MAX_N][2][16];

bitset<MAX_N> a,b;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin>>N;
    for(int i = 1; i <= N; i++){
        cin>>A[i];
    }
    for(int i = 1; i <= N; i++){
        cin>>B[i];
    }
 
    for(int i =1; i <= N; i++){
       
        a[i] = int(A[i]^'0');
        b[i] = int(B[i]^'0');
 
    }
    for(int j = 0; j < MAX_N; j++){
        for(int i = 0; i < 16; i++){
            dp[j][0][i] = INF;
            dp[j][1][i] = INF;
        }
    }
    dp[0][0][0] = 0;
    for(int i = 1; i <= N; i++){
        for(int k = 0; k < 2; k++){
            for(int j = 0; j < 16; j++){
                vector<pair<int,int> > cennik;
                cennik.pb({0,0});
                cennik.pb({1,1});
                cennik.pb({2,1});
                cennik.pb({4,1});
                cennik.pb({5,2});
                cennik.pb({6,2});
                cennik.pb({8,1});
                cennik.pb({9,2});
                cennik.pb({10,2});
                cennik.pb({j,0});
                cennik.pb({j/4,0});
                cennik.pb({(j<<2)&16+1,1});
                cennik.pb({(j<<2)&16+2,1});
                for(auto t : cennik){
                    dp[i][k][t.fi] = min(dp[i-1][0][j] + k + t.se, dp[i][k][t.fi]);
                    dp[i][k][t.fi] = min(dp[i-1][1][j] + 0 + t.se, dp[i][k][t.fi]);
                }
            }
            
        }
        for(int k = 0; k < 2; k++){
        for(int j = 0; j < 16; j++){
            int R,T;
            R=j/4; T=j%4;
            int kwiatek = T;
            if(kwiatek == 0) kwiatek = R;
            int wart_a = int(A[i]^'0');
            int wart_b = int(B[i]^'0');
            bool ok = false;
            if(kwiatek == 0){
                if((wart_a^k)==wart_b) ok = true;
            }else{
                kwiatek--;
                kwiatek^=k;
                if(wart_b == kwiatek) ok = true;
            }
            if(!ok){
                dp[i][k][j] = INF;
            } 
        }
        }
    }
    int odp = INF;
    for(int i = 0; i < 16; i++){
        odp = min(odp,dp[N][0][i]);
        odp = min(odp,dp[N][1][i]);
    }

    cout<<odp<<"\n";
   


    return 0;
}

Compilation message

lamp.cpp: In function 'int main()':
lamp.cpp:76:37: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   76 |                 cennik.pb({(j<<2)&16+1,1});
      |                                   ~~^~
lamp.cpp:77:37: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   77 |                 cennik.pb({(j<<2)&16+2,1});
      |                                   ~~^~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 127568 KB Output is correct
2 Correct 35 ms 127568 KB Output is correct
3 Correct 35 ms 127568 KB Output is correct
4 Correct 35 ms 127568 KB Output is correct
5 Correct 35 ms 127568 KB Output is correct
6 Correct 35 ms 127580 KB Output is correct
7 Correct 34 ms 127484 KB Output is correct
8 Correct 35 ms 127580 KB Output is correct
9 Correct 34 ms 127504 KB Output is correct
10 Correct 34 ms 127568 KB Output is correct
11 Correct 34 ms 127572 KB Output is correct
12 Correct 35 ms 127572 KB Output is correct
13 Correct 38 ms 127568 KB Output is correct
14 Correct 35 ms 127576 KB Output is correct
15 Correct 39 ms 127576 KB Output is correct
16 Correct 35 ms 127572 KB Output is correct
17 Correct 36 ms 127628 KB Output is correct
18 Correct 36 ms 127572 KB Output is correct
19 Correct 36 ms 127580 KB Output is correct
20 Correct 36 ms 127572 KB Output is correct
21 Correct 36 ms 127592 KB Output is correct
22 Correct 34 ms 127536 KB Output is correct
23 Correct 35 ms 127476 KB Output is correct
24 Correct 35 ms 127580 KB Output is correct
25 Correct 35 ms 127556 KB Output is correct
26 Correct 34 ms 127580 KB Output is correct
27 Correct 36 ms 127432 KB Output is correct
28 Correct 35 ms 127572 KB Output is correct
29 Correct 34 ms 127568 KB Output is correct
30 Correct 34 ms 127580 KB Output is correct
31 Correct 36 ms 127568 KB Output is correct
32 Correct 35 ms 127568 KB Output is correct
33 Correct 36 ms 127552 KB Output is correct
34 Correct 37 ms 127568 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 127568 KB Output is correct
2 Correct 35 ms 127568 KB Output is correct
3 Correct 35 ms 127568 KB Output is correct
4 Correct 35 ms 127568 KB Output is correct
5 Correct 35 ms 127568 KB Output is correct
6 Correct 35 ms 127580 KB Output is correct
7 Correct 34 ms 127484 KB Output is correct
8 Correct 35 ms 127580 KB Output is correct
9 Correct 34 ms 127504 KB Output is correct
10 Correct 34 ms 127568 KB Output is correct
11 Correct 34 ms 127572 KB Output is correct
12 Correct 35 ms 127572 KB Output is correct
13 Correct 38 ms 127568 KB Output is correct
14 Correct 35 ms 127576 KB Output is correct
15 Correct 39 ms 127576 KB Output is correct
16 Correct 35 ms 127572 KB Output is correct
17 Correct 36 ms 127628 KB Output is correct
18 Correct 36 ms 127572 KB Output is correct
19 Correct 36 ms 127580 KB Output is correct
20 Correct 36 ms 127572 KB Output is correct
21 Correct 36 ms 127592 KB Output is correct
22 Correct 34 ms 127536 KB Output is correct
23 Correct 35 ms 127476 KB Output is correct
24 Correct 35 ms 127580 KB Output is correct
25 Correct 35 ms 127556 KB Output is correct
26 Correct 34 ms 127580 KB Output is correct
27 Correct 36 ms 127432 KB Output is correct
28 Correct 35 ms 127572 KB Output is correct
29 Correct 34 ms 127568 KB Output is correct
30 Correct 34 ms 127580 KB Output is correct
31 Correct 36 ms 127568 KB Output is correct
32 Correct 35 ms 127568 KB Output is correct
33 Correct 36 ms 127552 KB Output is correct
34 Correct 37 ms 127568 KB Output is correct
35 Correct 44 ms 127580 KB Output is correct
36 Correct 42 ms 127576 KB Output is correct
37 Correct 47 ms 127568 KB Output is correct
38 Correct 50 ms 127668 KB Output is correct
39 Correct 44 ms 127664 KB Output is correct
40 Correct 46 ms 127572 KB Output is correct
41 Correct 44 ms 127580 KB Output is correct
42 Correct 45 ms 127512 KB Output is correct
43 Correct 46 ms 127820 KB Output is correct
44 Correct 48 ms 127572 KB Output is correct
45 Correct 43 ms 127640 KB Output is correct
46 Correct 45 ms 127556 KB Output is correct
47 Correct 46 ms 127572 KB Output is correct
48 Correct 44 ms 127572 KB Output is correct
49 Correct 44 ms 127492 KB Output is correct
50 Correct 43 ms 127580 KB Output is correct
51 Correct 43 ms 127580 KB Output is correct
52 Correct 46 ms 127608 KB Output is correct
53 Correct 44 ms 127568 KB Output is correct
54 Correct 52 ms 127572 KB Output is correct
55 Correct 44 ms 127568 KB Output is correct
56 Correct 44 ms 127508 KB Output is correct
57 Correct 44 ms 127564 KB Output is correct
58 Correct 46 ms 127640 KB Output is correct

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 127480 KB Output is correct
2 Correct 36 ms 127576 KB Output is correct
3 Correct 37 ms 127516 KB Output is correct
4 Correct 37 ms 127624 KB Output is correct
5 Correct 35 ms 127572 KB Output is correct
6 Correct 36 ms 127580 KB Output is correct
7 Execution timed out 1055 ms 127836 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 127568 KB Output is correct
2 Correct 35 ms 127568 KB Output is correct
3 Correct 35 ms 127568 KB Output is correct
4 Correct 35 ms 127568 KB Output is correct
5 Correct 35 ms 127568 KB Output is correct
6 Correct 35 ms 127580 KB Output is correct
7 Correct 34 ms 127484 KB Output is correct
8 Correct 35 ms 127580 KB Output is correct
9 Correct 34 ms 127504 KB Output is correct
10 Correct 34 ms 127568 KB Output is correct
11 Correct 34 ms 127572 KB Output is correct
12 Correct 35 ms 127572 KB Output is correct
13 Correct 38 ms 127568 KB Output is correct
14 Correct 35 ms 127576 KB Output is correct
15 Correct 39 ms 127576 KB Output is correct
16 Correct 35 ms 127572 KB Output is correct
17 Correct 36 ms 127628 KB Output is correct
18 Correct 36 ms 127572 KB Output is correct
19 Correct 36 ms 127580 KB Output is correct
20 Correct 36 ms 127572 KB Output is correct
21 Correct 36 ms 127592 KB Output is correct
22 Correct 34 ms 127536 KB Output is correct
23 Correct 35 ms 127476 KB Output is correct
24 Correct 35 ms 127580 KB Output is correct
25 Correct 35 ms 127556 KB Output is correct
26 Correct 34 ms 127580 KB Output is correct
27 Correct 36 ms 127432 KB Output is correct
28 Correct 35 ms 127572 KB Output is correct
29 Correct 34 ms 127568 KB Output is correct
30 Correct 34 ms 127580 KB Output is correct
31 Correct 36 ms 127568 KB Output is correct
32 Correct 35 ms 127568 KB Output is correct
33 Correct 36 ms 127552 KB Output is correct
34 Correct 37 ms 127568 KB Output is correct
35 Correct 44 ms 127580 KB Output is correct
36 Correct 42 ms 127576 KB Output is correct
37 Correct 47 ms 127568 KB Output is correct
38 Correct 50 ms 127668 KB Output is correct
39 Correct 44 ms 127664 KB Output is correct
40 Correct 46 ms 127572 KB Output is correct
41 Correct 44 ms 127580 KB Output is correct
42 Correct 45 ms 127512 KB Output is correct
43 Correct 46 ms 127820 KB Output is correct
44 Correct 48 ms 127572 KB Output is correct
45 Correct 43 ms 127640 KB Output is correct
46 Correct 45 ms 127556 KB Output is correct
47 Correct 46 ms 127572 KB Output is correct
48 Correct 44 ms 127572 KB Output is correct
49 Correct 44 ms 127492 KB Output is correct
50 Correct 43 ms 127580 KB Output is correct
51 Correct 43 ms 127580 KB Output is correct
52 Correct 46 ms 127608 KB Output is correct
53 Correct 44 ms 127568 KB Output is correct
54 Correct 52 ms 127572 KB Output is correct
55 Correct 44 ms 127568 KB Output is correct
56 Correct 44 ms 127508 KB Output is correct
57 Correct 44 ms 127564 KB Output is correct
58 Correct 46 ms 127640 KB Output is correct
59 Correct 36 ms 127480 KB Output is correct
60 Correct 36 ms 127576 KB Output is correct
61 Correct 37 ms 127516 KB Output is correct
62 Correct 37 ms 127624 KB Output is correct
63 Correct 35 ms 127572 KB Output is correct
64 Correct 36 ms 127580 KB Output is correct
65 Execution timed out 1055 ms 127836 KB Time limit exceeded
66 Halted 0 ms 0 KB -