oj.uz

Submission #409933

# Submission time Handle Problem Language Result Execution time Memory
409933 2021-05-21T19:25:54 Z Blistering_Barnacles Painting Walls (APIO20_paint) C++11
0 / 100
 20 ms 36564 KB 
#include "paint.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define Co continue
#define R return
#define Br break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[200005] , a[555555] , b[555555] , ok[200005] , k, l, m, n, o, p;
map < ll , ll > mp[200005];
vll adj[555555] , adj2[555555];
const ll mod = 1e9+7;
str s;
vll  c ;
int minimumInstructions(int N, int M, int K, vector<int> C, std::vector<int> A, std::vector<std::vector<int>> B) {
    msdp(dp) ;
    c = C ;
    n = N ;
    m = M ;
    for(ll i = 0 ; i < m ; i++){
        //cout << i << " " ;
        for(ll j = 0 ; j < A[i] ; j++){
            a[B[i][j]] = i ;
        }
    }
    vector < pll > v ;
    ll cur = a[c[0]] , s = 0 , e = 0 ;
    for(ll i = 0 ; i < n ; i++){
        ll op = (cur + 1) % m ;
        if(op == C[0])e++ ;
        else {
            if(e - s + 1 >= m)v.pb({s , e}) ;
            s = e = i ;
        }
        cur = a[c[i]] ;
    }
    ll ans = 0 ;
    for(auto u : v){
        b[u.F]++ , b[u.S + 1]-- ;
        ans += (u.S - u.F + 1) / K + ( (u.S - u.F + 1) % K > 0 ) ;
    }
    if(!b[0])R 0 ;
    for(ll i = 1 ; i < n ; i++){
        b[i] += b[i - 1] ;
        if(!b[i])R -1 ;
    }
    R ans ;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 36564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 36564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 36564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 36564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 36564 KB Output isn't correct
2 Halted 0 ms 0 KB -