oj.uz

Submission #384715

# Submission time Handle Problem Language Result Execution time Memory
384715 2021-04-02T06:01:57 Z kwongweng Painting Walls (APIO20_paint) C++14
0 / 100
 1 ms 492 KB 
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)

int minimumInstructions(int n, int m, int k, vi c, vi a, vector<vi> b) {
    int ans = 1;
    vi num(m);
    vector<vi> con(k);
    FOR(i, 0, m){
        FOR(j, 0, a[i]){
            con[b[i][j]].push_back(i);
        }
    }
    FOR(i, 0, m){
        for (int k : con[c[i]]){
            num[(k-i+m)%m]++;
        }
    }
    int cnt = 0;
    FOR(i, 0, m){
        if (num[i] == m) cnt++;
    }
    vi check(n);
    if (cnt > 0) check[0] = 1;
    FOR(i, 0, n-m){
        for (int k : con[c[i]]){
            k = (k - i + m) % m;
            if (num[k] == m) cnt--;
            num[k]--;
        }
        for (int k : con[c[i+m]]){
            k = (k - i + m) % m;
            if (num[k] == m-1) cnt++;
            num[k]++;
        }
        if (cnt > 0) check[i+1] = 1;
    }
    bool sol = true;
    int cur = 0;
    while (cur < n-m){
        if (check[cur] != 1){
            sol = false; break;
        }
        ans++;
        int r = -1;
        ROF(i, cur + m, cur+1){
            if (check[i] == 1){
                r = i;
                break;
            }
        }
        if (r == -1){
            sol = false; break;
        }
        cur = r;
    }
    if (!sol) return -1; 
    return ans;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Runtime error 1 ms 492 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Runtime error 1 ms 492 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Runtime error 1 ms 492 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Runtime error 1 ms 492 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Runtime error 1 ms 492 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -