oj.uz

Submission #361615

# Submission time Handle Problem Language Result Execution time Memory
361615 2021-01-30T20:21:10 Z MvC Painting Walls (APIO20_paint) C++11
0 / 100
 3 ms 2668 KB 
#include "paint.h"
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define lun(x) (int)x.size()
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<60);
const int inf=(1<<30);
const int nmax=1e5+50;
const ll mod=1e9+7;
using namespace std;
int i,l,j,ps[nmax],rs,mx,nx,p;
vector<pair<int,int> >cl[nmax];
int minimumInstructions(int n,int m,int k,vector<int> c,vector<int> b,vector<vector<int> > a)
{
    for(i=0;i<m;i++)for(j=0;j<b[i];j++)cl[a[i][j]].pb(mkp(i,0));
    for(i=0;i<k;i++)sort(all(cl[i]));
    for(i=0;i<n;i++)
    {
        for(j=0;j<lun(cl[c[i]]);j++)
        {
            l=(cl[c[i]][j].fr-1+m)%m;
            cl[c[i]][j].sc=i;
            if(i)
            {
                p=lower_bound(all(cl[c[i-1]]),mkp(l,-1))-cl[c[i-1]].begin();
                if(p<lun(cl[c[i-1]]) && cl[c[i-1]][p].fr==l)
                {
                    cl[c[i]][j].sc=cl[c[i-1]][p].sc;
                }
            }
            if(i-cl[c[i]][j].sc+1==m)ps[cl[c[i]][j].sc]=1;
        }
    }
    for(i=0;i<n-m;i++)
    {
        if(ps[i])mx=i;
        if(nx==i)
        {
            if(mx+m-1>=i)
            {
                rs++;
                nx=mx+m;
            }
            else
            {
                rs=-1;
                break;
            }
        }
    }
    if(!ps[n-m])rs=-1;
    else if(rs!=-1)rs++;
    return rs;
}
/*int main()
{
    //freopen("sol.in","r",stdin);
    //freopen("sol.out","w",stdout);
    //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);

    return 0;
}*/

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Incorrect 2 ms 2668 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Incorrect 2 ms 2668 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Incorrect 2 ms 2668 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Incorrect 2 ms 2668 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Incorrect 2 ms 2668 KB Output isn't correct
5 Halted 0 ms 0 KB -