Submission #1200834

#TimeUsernameProblemLanguageResultExecution timeMemory
1200834edogawa_somethingPainting Walls (APIO20_paint)C++20
0 / 100
0 ms324 KiB
#include "paint.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> vii; typedef pair<ll,ll> pii; #define pb push_back #define F first #define S second #define all(v) v.begin(),v.end() const ll M=1e5+10; ll n,m,c[M],a[M]; ll b[201][M],chk[505][202],cc[M]; int minimumInstructions(int N,int M,int K,vector<int>C,vector<int>A,vector<vector<int>>B) { n=N,m=M; if(m<n) return -1; for(int i=0;i<n;i++) c[i]=C[i]; for(int i=0;i<m;i++){ a[i]=A[i]; for(int j=0;j<a[i];j++) b[i][j]=B[i][j]; } ll r=0; for(int i=0;i<n;i++){ if(b[i][0]==c[0]) r=i; } for(int i=0;i<n;i++){ if(b[(i+r)%m][0]!=c[i]) return -1; } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...