oj.uz

Submission #1001765

# Submission time Handle Problem Language Result Execution time Memory
1001765 2024-06-19T07:35:44 Z snpmrnhlol Lamps (JOI19_lamps) C++17
4 / 100
 141 ms 27796 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6;
const int inf = 2e9;
array <int,6> dp[N + 1];
int m[6][6] = {
    {0,1,1,1,2,2},
    {0,0,1,1,1,2},
    {0,1,0,1,2,1},
    {0,1,1,0,1,1},
    {0,0,1,1,0,1},
    {0,1,0,1,1,0}
};
int values[6] = {2,1,0,3,0,1};
bool v[N],v2[N];
int main(){
    int n;
    cin>>n;
    for(int i = 0;i < n;i++){char ch;cin>>ch;v[i] = ch - '0';}
    for(int i = 0;i < n;i++){char ch;cin>>ch;v2[i] = ch - '0';}
    dp[0] = {0,inf,inf,inf,inf,inf};
    ///0 - empty 1 - on 2 - off
    ///3 - toggle 4 - on toggle 5 - off toggle
    for(int i = 0;i < n;i++){
        dp[i + 1] = {inf,inf,inf,inf,inf,inf};
        for(int j = 0;j < 6;j++){
            for(int k = 0;k < 6;k++){
                int cost = m[j][k];
                if((values[k] >= 2 && ((v[i]^v2[i]) == values[k] - 2)) || (values[k] <= 1 && values[k] == v2[i])){
                    dp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + cost);
                }
            }
        }
    }
    int ans = inf;
    for(int j = 0;j < 6;j++)ans = min(ans, dp[n][j]);
    cout<<ans;
    return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 444 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 444 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 101 ms 27612 KB Output is correct
8 Correct 103 ms 27592 KB Output is correct
9 Correct 101 ms 27720 KB Output is correct
10 Correct 141 ms 27796 KB Output is correct
11 Correct 102 ms 27660 KB Output is correct
12 Correct 100 ms 27560 KB Output is correct
13 Correct 121 ms 27728 KB Output is correct
14 Correct 105 ms 27640 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 444 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Halted 0 ms 0 KB -