# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
121965 | KLPP | Lamps (JOI19_lamps) | C++14 | 153 ms | 28136 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
int DP[2000000][2][3];
int diff[2000000];
int zeros[2000000];
int ones[2000000];
string A,B;
int valid(int i, int j, int k){
if(k==0){
//cout<<(A[i]==B[i])<<endl;
return ((A[i]==B[i])+j)%2;
}
return ((B[i]==(k-1+'0'))+j)%2;
}
int main(){
int n;
cin>>n;
cin>>A>>B;
rep(i,0,n+1){
rep(j,0,2){
rep(k,0,3){
DP[i][j][k]=10000000;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |