oj.uz

답안 #235250

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
235250 2020-05-27T14:04:49 Z Nodir_Bobiev Lamps (JOI19_lamps) C++17
47 / 100
 1000 ms 74232 KB 
/*
+----------------------------------------------------------------+
| In the name of Allah, the most Gracious and the most Merciful. |
+----------------------------------------------------------------+
Our hearts quake with fear of you
Our hearts wake with love for you
And to Islam we must be true
In everything we think and do.
--------------------------------
When your heart is breaking
And your pain makes you fall
Remember just remember
Allah Sees it all.
*/
# include <bits/stdc++.h>
# define FILE
using namespace std;

const int N = 1e6 + 100;
const int inf = 1e9;
string A,B;
int n;
vector < vector < int > > dp[N];
vector < vector < int > > oper= { {}, {1}, {2}, {3}, {1,1}, 
                                  {1,2}, {1,3}, {2,1}, {2,2}, 
                                  {2,3}, {3,1}, {3,2}, {3,3},
                                  {1,1,1}, {2,2,2}, {3,3,3}, 
                                  {1,2,3}, {1,3,2}, {2,1,3},
                                  {2,3,1}, {3,1,2}, {3,2,1}
                                };  
char op(int x, char c){
    if( x == 0 ) return c;
    if( x == 1 ) return '0';
    if( x == 2 ) return '1';
    if( c == '1' ) return '0';
    return '1';
}
int get( vector < int >&v1, vector < int >&v2, int i=0, int j=0 ){
    if( i == (int)v1.size() || j == (int)v2.size()-1)return 0;
    int mx = 0;
    if( v1[i] == v2[j] ) mx = get(v1, v2, i+1, j+1) + 1;
    mx = max({mx, get(v1, v2, i+1, j), get(v1, v2, i, j+1)});
    return mx;
}

int main(){
    # ifdef FILEs
        freopen( "input.txt", "r", stdin );
        freopen( "output.txt", "w", stdout );
    # endif
    ios_base::sync_with_stdio(false);
    cin >> n >> A >> B;
    A = '0' + A;
    B = '0' + B;

    dp[0].push_back({0});

    for( int i = 1; i <= n; i ++ ){
        for( auto &v1: oper ){
            char cc = A[i];
            for( auto c: v1 )
                cc = op(c, cc);
            if( cc != B[i] )
                continue;
            int res = inf;
            for( auto v2: dp[i-1] ){
                res = min( res, v2.back() + (int)v1.size() - get(v1, v2) );
            }
            if( res != inf ){
                v1.push_back(res);
                dp[i].push_back(v1);
                v1.pop_back();
            }
        }
    }
    int ans = inf;
    for( auto vc: dp[n] )ans = min( ans, vc.back() );
    cout << ans;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 18 ms 23772 KB Output is correct
6 Correct 19 ms 23808 KB Output is correct
7 Execution timed out 1093 ms 74232 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 18 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 18 ms 23808 KB Output is correct
11 Correct 18 ms 23808 KB Output is correct
12 Correct 18 ms 23808 KB Output is correct
13 Correct 18 ms 23808 KB Output is correct
14 Correct 18 ms 23808 KB Output is correct
15 Correct 18 ms 23808 KB Output is correct
16 Correct 18 ms 23808 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 19 ms 23808 KB Output is correct
19 Correct 18 ms 23808 KB Output is correct
20 Correct 18 ms 23808 KB Output is correct
21 Correct 18 ms 23808 KB Output is correct
22 Correct 18 ms 23808 KB Output is correct
23 Correct 19 ms 23808 KB Output is correct
24 Correct 18 ms 23808 KB Output is correct
25 Correct 18 ms 23808 KB Output is correct
26 Correct 18 ms 23808 KB Output is correct
27 Correct 19 ms 23808 KB Output is correct
28 Correct 18 ms 23808 KB Output is correct
29 Correct 19 ms 23936 KB Output is correct
30 Correct 19 ms 23808 KB Output is correct
31 Correct 19 ms 23808 KB Output is correct
32 Correct 19 ms 23808 KB Output is correct
33 Correct 18 ms 23808 KB Output is correct
34 Correct 18 ms 23808 KB Output is correct
35 Correct 55 ms 25336 KB Output is correct
36 Correct 58 ms 25428 KB Output is correct
37 Correct 57 ms 25496 KB Output is correct
38 Correct 53 ms 25336 KB Output is correct
39 Correct 55 ms 25336 KB Output is correct
40 Correct 58 ms 25408 KB Output is correct
41 Correct 58 ms 25336 KB Output is correct
42 Correct 54 ms 25484 KB Output is correct
43 Correct 54 ms 25336 KB Output is correct
44 Correct 53 ms 25336 KB Output is correct
45 Correct 53 ms 25496 KB Output is correct
46 Correct 53 ms 25340 KB Output is correct
47 Correct 54 ms 25336 KB Output is correct
48 Correct 54 ms 25340 KB Output is correct
49 Correct 53 ms 25336 KB Output is correct
50 Correct 54 ms 25388 KB Output is correct
51 Correct 53 ms 25336 KB Output is correct
52 Correct 53 ms 25336 KB Output is correct
53 Correct 53 ms 25336 KB Output is correct
54 Correct 57 ms 25340 KB Output is correct
55 Correct 53 ms 25340 KB Output is correct
56 Correct 58 ms 25336 KB Output is correct
57 Correct 61 ms 25336 KB Output is correct
58 Correct 56 ms 25336 KB Output is correct
59 Correct 19 ms 23808 KB Output is correct
60 Correct 20 ms 23808 KB Output is correct
61 Correct 18 ms 23808 KB Output is correct
62 Correct 19 ms 23808 KB Output is correct
63 Correct 18 ms 23772 KB Output is correct
64 Correct 19 ms 23808 KB Output is correct
65 Execution timed out 1093 ms 74232 KB Time limit exceeded
66 Halted 0 ms 0 KB -