oj.uz

답안 #107706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107706 2019-04-25T13:55:41 Z shayan_p Lamps (JOI19_lamps) C++14
100 / 100
 61 ms 27992 KB 
// Faster!

#include<bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int maxn=1e6+10,mod=1e9+7;
const ll inf=1e18;

int dp[maxn][3][2];
string A,B;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int n;cin>>n>>A>>B;
    for(int i=1;i<=n;i++){
	int a=A[i-1]-'0',b=B[i-1]-'0';
	for(int j=0;j<3;j++)
	    for(int k=0;k<2;k++)
		dp[i][j][k]=n;
	if(a==b){
	    for(int j=0;j<3;j++)
		for(int k=0;k<2;k++)
		    dp[i][j][k]=min(dp[i][j][k],dp[i-1][0][0]);
	}
	else{
	    for(int j=0;j<3;j++)
		for(int k=0;k<2;k++)
		    dp[i][j][k]=min(dp[i][j][k],(k==1 ? 0 : 1) + dp[i-1][0][1]);
	}
	for(int j=0;j<3;j++)
	    for(int k=0;k<2;k++)
		dp[i][j][k]=min(dp[i][j][k],(j==b+1 ? 0 : 1) + dp[i-1][b+1][0] );
	for(int j=0;j<3;j++)
	    for(int k=0;k<2;k++)
		dp[i][j][k]=min(dp[i][j][k],(j==1-b+1 ? 0 : 1) + (k==1 ? 0 : 1) + dp[i-1][1-b+1][1] );
    }
    return cout<<dp[n][0][0]<<endl,0;
}
// Deathly mistakes:
//  * Read the problem curfully.
//  * Check maxn.
//  * Overflows.

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 4 ms 380 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 428 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct

Subtask #2
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 4 ms 380 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 428 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 3 ms 384 KB Output is correct
43 Correct 3 ms 384 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 2 ms 384 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 2 ms 384 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 3 ms 304 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 3 ms 384 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 384 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 45 ms 26160 KB Output is correct
8 Correct 45 ms 26180 KB Output is correct
9 Correct 42 ms 26184 KB Output is correct
10 Correct 57 ms 26176 KB Output is correct
11 Correct 49 ms 26232 KB Output is correct
12 Correct 48 ms 26184 KB Output is correct
13 Correct 42 ms 26188 KB Output is correct
14 Correct 50 ms 26184 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 4 ms 380 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 428 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 3 ms 384 KB Output is correct
43 Correct 3 ms 384 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 2 ms 384 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 2 ms 384 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 3 ms 304 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 3 ms 384 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 384 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 3 ms 384 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 2 ms 384 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 45 ms 26160 KB Output is correct
66 Correct 45 ms 26180 KB Output is correct
67 Correct 42 ms 26184 KB Output is correct
68 Correct 57 ms 26176 KB Output is correct
69 Correct 49 ms 26232 KB Output is correct
70 Correct 48 ms 26184 KB Output is correct
71 Correct 42 ms 26188 KB Output is correct
72 Correct 50 ms 26184 KB Output is correct
73 Correct 46 ms 27844 KB Output is correct
74 Correct 46 ms 27796 KB Output is correct
75 Correct 49 ms 27848 KB Output is correct
76 Correct 47 ms 27848 KB Output is correct
77 Correct 45 ms 27852 KB Output is correct
78 Correct 46 ms 27848 KB Output is correct
79 Correct 48 ms 27852 KB Output is correct
80 Correct 43 ms 27852 KB Output is correct
81 Correct 45 ms 27852 KB Output is correct
82 Correct 56 ms 27976 KB Output is correct
83 Correct 50 ms 27852 KB Output is correct
84 Correct 61 ms 27848 KB Output is correct
85 Correct 55 ms 27980 KB Output is correct
86 Correct 51 ms 27820 KB Output is correct
87 Correct 57 ms 27820 KB Output is correct
88 Correct 52 ms 27852 KB Output is correct
89 Correct 54 ms 27844 KB Output is correct
90 Correct 52 ms 27848 KB Output is correct
91 Correct 55 ms 27844 KB Output is correct
92 Correct 47 ms 27848 KB Output is correct
93 Correct 51 ms 27848 KB Output is correct
94 Correct 58 ms 27976 KB Output is correct
95 Correct 55 ms 27844 KB Output is correct
96 Correct 54 ms 27848 KB Output is correct
97 Correct 61 ms 27972 KB Output is correct
98 Correct 50 ms 27868 KB Output is correct
99 Correct 55 ms 27892 KB Output is correct
100 Correct 53 ms 27992 KB Output is correct
101 Correct 54 ms 27852 KB Output is correct
102 Correct 57 ms 27980 KB Output is correct