oj.uz

답안 #235246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
235246 2020-05-27T13:48:35 Z Nodir_Bobiev Lamps (JOI19_lamps) C++17
6 / 100
 1000 ms 40640 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 = 9;
string A,B;
int n;
vector < vector < int > > dp[N];

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( int a = 0; a < 4; a ++ ){
            for( int b = 0; b < 4; b ++ ){
                for( int c = 0; c < 4; c ++ ){
                    if( op(c,op(b,op(a,A[i]))) != B[i] ) continue;
                    
                    vector < int > vv;
                    if( a ) vv.push_back( a ); 
                    if( b ) vv.push_back( b );
                    if( c ) vv.push_back( c );

                    int mn = inf;
                    for( auto vc: dp[i-1] ){
                        mn = min(mn, vc.back()-get(vv, vc)+(int)vv.size());
                    }
                    if( mn != inf ){
                        vv.push_back(mn);
                        dp[i].push_back(vv);
                    }
                }
            }
        }
    }
    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 20 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 19 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 19 ms 23808 KB Output is correct
8 Correct 21 ms 23808 KB Output is correct
9 Correct 22 ms 23808 KB Output is correct
10 Correct 25 ms 23936 KB Output is correct
11 Correct 21 ms 23936 KB Output is correct
12 Correct 21 ms 23808 KB Output is correct
13 Correct 23 ms 23808 KB Output is correct
14 Correct 22 ms 23808 KB Output is correct
15 Correct 21 ms 23808 KB Output is correct
16 Correct 21 ms 23808 KB Output is correct
17 Correct 21 ms 23808 KB Output is correct
18 Correct 22 ms 23828 KB Output is correct
19 Correct 20 ms 23808 KB Output is correct
20 Correct 21 ms 23808 KB Output is correct
21 Correct 20 ms 23808 KB Output is correct
22 Correct 21 ms 23808 KB Output is correct
23 Correct 21 ms 23808 KB Output is correct
24 Correct 21 ms 23808 KB Output is correct
25 Correct 21 ms 23808 KB Output is correct
26 Correct 20 ms 23808 KB Output is correct
27 Correct 21 ms 23808 KB Output is correct
28 Correct 21 ms 23808 KB Output is correct
29 Correct 23 ms 23808 KB Output is correct
30 Correct 21 ms 23936 KB Output is correct
31 Correct 20 ms 23808 KB Output is correct
32 Correct 21 ms 23808 KB Output is correct
33 Correct 21 ms 23808 KB Output is correct
34 Correct 21 ms 23808 KB Output is correct

Subtask #2
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 19 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 19 ms 23808 KB Output is correct
8 Correct 21 ms 23808 KB Output is correct
9 Correct 22 ms 23808 KB Output is correct
10 Correct 25 ms 23936 KB Output is correct
11 Correct 21 ms 23936 KB Output is correct
12 Correct 21 ms 23808 KB Output is correct
13 Correct 23 ms 23808 KB Output is correct
14 Correct 22 ms 23808 KB Output is correct
15 Correct 21 ms 23808 KB Output is correct
16 Correct 21 ms 23808 KB Output is correct
17 Correct 21 ms 23808 KB Output is correct
18 Correct 22 ms 23828 KB Output is correct
19 Correct 20 ms 23808 KB Output is correct
20 Correct 21 ms 23808 KB Output is correct
21 Correct 20 ms 23808 KB Output is correct
22 Correct 21 ms 23808 KB Output is correct
23 Correct 21 ms 23808 KB Output is correct
24 Correct 21 ms 23808 KB Output is correct
25 Correct 21 ms 23808 KB Output is correct
26 Correct 20 ms 23808 KB Output is correct
27 Correct 21 ms 23808 KB Output is correct
28 Correct 21 ms 23808 KB Output is correct
29 Correct 23 ms 23808 KB Output is correct
30 Correct 21 ms 23936 KB Output is correct
31 Correct 20 ms 23808 KB Output is correct
32 Correct 21 ms 23808 KB Output is correct
33 Correct 21 ms 23808 KB Output is correct
34 Correct 21 ms 23808 KB Output is correct
35 Incorrect 28 ms 23808 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #3
0 / 4.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 23784 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 21 ms 23808 KB Output is correct
6 Correct 19 ms 23808 KB Output is correct
7 Execution timed out 1090 ms 40640 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 19 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 19 ms 23808 KB Output is correct
8 Correct 21 ms 23808 KB Output is correct
9 Correct 22 ms 23808 KB Output is correct
10 Correct 25 ms 23936 KB Output is correct
11 Correct 21 ms 23936 KB Output is correct
12 Correct 21 ms 23808 KB Output is correct
13 Correct 23 ms 23808 KB Output is correct
14 Correct 22 ms 23808 KB Output is correct
15 Correct 21 ms 23808 KB Output is correct
16 Correct 21 ms 23808 KB Output is correct
17 Correct 21 ms 23808 KB Output is correct
18 Correct 22 ms 23828 KB Output is correct
19 Correct 20 ms 23808 KB Output is correct
20 Correct 21 ms 23808 KB Output is correct
21 Correct 20 ms 23808 KB Output is correct
22 Correct 21 ms 23808 KB Output is correct
23 Correct 21 ms 23808 KB Output is correct
24 Correct 21 ms 23808 KB Output is correct
25 Correct 21 ms 23808 KB Output is correct
26 Correct 20 ms 23808 KB Output is correct
27 Correct 21 ms 23808 KB Output is correct
28 Correct 21 ms 23808 KB Output is correct
29 Correct 23 ms 23808 KB Output is correct
30 Correct 21 ms 23936 KB Output is correct
31 Correct 20 ms 23808 KB Output is correct
32 Correct 21 ms 23808 KB Output is correct
33 Correct 21 ms 23808 KB Output is correct
34 Correct 21 ms 23808 KB Output is correct
35 Incorrect 28 ms 23808 KB Output isn't correct
36 Halted 0 ms 0 KB -