oj.uz

Submission #979591

# Submission time Handle Problem Language Result Execution time Memory
979591 2024-05-11T08:02:12 Z vjudge1 Painting Walls (APIO20_paint) C++17
0 / 100
 717 ms 444 KB 
#include "paint.h"
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;

int eq(vector<int> c, int p, vector<vector<int>> b, int m)
{
    int ok = 1;
    for(int i = p; i < p + m; ++i)
    {
        int _ok = 0;
        for(int j : b[i - p])
            _ok |= c[i] == j;
        ok &= _ok;
    }
    return ok;
}

void sdvig(vector<vector<int>> b, int m)
{
    for(int i = 0; i < m - 1; ++i)
        swap(b[i], b[i + 1]);
}

int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> a, vector<vector<int>> b)
{
    int i;
    int dp[n + 5] = {};
    for(i = 0; i <= n - m; ++i)
    {
        for(int t = 0; t < m && !dp[i]; ++t)
        {
            if(eq(c, i, b, m))
                dp[i] = 1;
            sdvig(b, m);
        }
    }
    int ans = 1, cur = 0;
    while(cur < n - m)
    {
        int lst = INF;
        for(i = cur + 1; i <= cur + m; ++i)
            if(dp[i])
                lst = i;
        cur = lst;
        ++ans;
    }
//    for(i = 0; i < n; ++i)
//        cout << dp[i] << ' ';
//    return;
    return (cur < INF ? ans : -1);
}

//int main()
//{
////    ios_base::sync_with_stdio(0);
////    cin.tie(0), cout.tie(0);
////    solve();
//}

//8 3 5
//3 3 1 3 4 4 2 2
//3 0 1 2
//2 2 3
//2 3 4

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Incorrect 717 ms 444 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Incorrect 717 ms 444 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Incorrect 717 ms 444 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Incorrect 717 ms 444 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Incorrect 717 ms 444 KB Output isn't correct
14 Halted 0 ms 0 KB -