oj.uz

답안 #768984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768984 2023-06-29T03:59:22 Z bachhoangxuan Lamps (JOI19_lamps) C++17
100 / 100
 152 ms 72904 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int mod=1e9+7;
const int maxn=1000005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
int dp[maxn][4][4],f[2][4][4];
int g(int x,int t){
    if(t==0) return x;
    else if(t==1) return 0;
    else if(t==2) return 1;
    else return x^1;
}
void solve(){
    int n;cin >> n;
    vector<int> a(n+1),b(n+1);
    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';}
    for(int i=0;i<=n;i++) for(int j=0;j<4;j++) for(int k=0;k<4;k++) dp[i][j][k]=inf;
    for(int i=0;i<2;i++) for(int j=0;j<4;j++) for(int k=0;k<4;k++) f[i][j][k]=g(g(i,j),k);
    dp[0][0][0]=0;
    for(int i=1;i<=n;i++){
        for(int j=0;j<4;j++){
            for(int k=0;k<4;k++){
                int w=dp[i-1][j][k];
                if(((j==k) == (k>=1)) || w==inf) continue;
                dp[i][j][k]=min(dp[i][j][k],w);
                dp[i][0][j]=min(dp[i][0][j],w);
                dp[i][0][k]=min(dp[i][0][k],w);
                dp[i][0][0]=min(dp[i][0][0],w);
            }
        }
        for(int j=0;j<4;j++){
            for(int k=0;k<4;k++){
                if((j==k) == (k>=1)) continue;
                dp[i][j][k]=min(dp[i][j][k],dp[i][0][j]+1);
                dp[i][j][k]=min(dp[i][j][k],dp[i][0][k]+1);
                dp[i][j][k]=min(dp[i][j][k],dp[i][0][0]+2);
            }
        }
        for(int j=0;j<4;j++){
            for(int k=0;k<4;k++) if(f[a[i]][j][k]!=b[i]) dp[i][j][k]=inf;
        }
    }
    int ans=inf;
    for(int i=0;i<4;i++){
        for(int j=0;j<4;j++) ans=min(ans,dp[n][i][j]);
    }
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 124 ms 72724 KB Output is correct
8 Correct 133 ms 72660 KB Output is correct
9 Correct 126 ms 72652 KB Output is correct
10 Correct 134 ms 72728 KB Output is correct
11 Correct 126 ms 72728 KB Output is correct
12 Correct 124 ms 72644 KB Output is correct
13 Correct 135 ms 72664 KB Output is correct
14 Correct 141 ms 72724 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 240 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 1 ms 512 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 392 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 456 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 124 ms 72724 KB Output is correct
66 Correct 133 ms 72660 KB Output is correct
67 Correct 126 ms 72652 KB Output is correct
68 Correct 134 ms 72728 KB Output is correct
69 Correct 126 ms 72728 KB Output is correct
70 Correct 124 ms 72644 KB Output is correct
71 Correct 135 ms 72664 KB Output is correct
72 Correct 141 ms 72724 KB Output is correct
73 Correct 133 ms 72652 KB Output is correct
74 Correct 126 ms 72648 KB Output is correct
75 Correct 128 ms 72724 KB Output is correct
76 Correct 126 ms 72656 KB Output is correct
77 Correct 133 ms 72720 KB Output is correct
78 Correct 125 ms 72648 KB Output is correct
79 Correct 132 ms 72724 KB Output is correct
80 Correct 123 ms 72728 KB Output is correct
81 Correct 124 ms 72652 KB Output is correct
82 Correct 125 ms 72652 KB Output is correct
83 Correct 133 ms 72668 KB Output is correct
84 Correct 143 ms 72656 KB Output is correct
85 Correct 133 ms 72668 KB Output is correct
86 Correct 134 ms 72732 KB Output is correct
87 Correct 141 ms 72904 KB Output is correct
88 Correct 133 ms 72648 KB Output is correct
89 Correct 134 ms 72656 KB Output is correct
90 Correct 130 ms 72648 KB Output is correct
91 Correct 144 ms 72728 KB Output is correct
92 Correct 136 ms 72672 KB Output is correct
93 Correct 140 ms 72728 KB Output is correct
94 Correct 152 ms 72728 KB Output is correct
95 Correct 143 ms 72732 KB Output is correct
96 Correct 138 ms 72724 KB Output is correct
97 Correct 137 ms 72652 KB Output is correct
98 Correct 145 ms 72728 KB Output is correct
99 Correct 144 ms 72652 KB Output is correct
100 Correct 136 ms 72648 KB Output is correct
101 Correct 148 ms 72728 KB Output is correct
102 Correct 149 ms 72628 KB Output is correct