Submission #977261

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
977261	2024-05-07T15:19:51 Z	Tuanlinh123	Painting Walls (APIO20_paint)	C++17	0 / 100	1 ms	600 KB

paint

#include "paint.h"
#include<bits/stdc++.h>
#define ll int
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;

int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> a, vector<vector<int>> b) 
{
    vector <ll> cnt(m, 0), to(n, -1);
    vector <vector <ll>> ok(k);
    for (ll i=0; i<m; i++)
        for (ll c:b[i]) ok[c].pb(i);
    ll cntall=0;
    auto upd=[&](ll id, ll v)
    {
        id=(id+m)%m, cnt[id]+=v;
        if (cnt[id]==m && v==1) cntall++;
        if (cnt[id]==m-1 && v==-1) cntall--;
    };
    for (ll i=0; i<m; i++)
        for (ll p:ok[c[i]]) upd(p-i, 1);
    if (cntall) to[0]=m;
    for (ll i=1; i+m<=n; i++)
    {
        for (ll p:ok[c[i-1]]) upd(p-i+1, -1);
        for (ll p:ok[c[i+m-1]]) upd(p-i+1, 1);
        if (cntall) to[i]=i+m; 
    }
    for (ll i=n-1; i; i--) to[i]=max(to[i], to[i-1]);
    ll cr=0, ans=0;
    while (cr<n)
    {
        if (to[cr]<=cr) return -1;
        cr=to[cr], ans++;
    }
    return ans;
}

Subtask #1

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	600 KB	Output is correct
9	Runtime error	1 ms	348 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	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	600 KB	Output is correct
9	Runtime error	1 ms	348 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	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	600 KB	Output is correct
9	Runtime error	1 ms	348 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	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	600 KB	Output is correct
9	Runtime error	1 ms	348 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	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	600 KB	Output is correct
9	Runtime error	1 ms	348 KB	Execution killed with signal 6
10	Halted	0 ms	0 KB	-