# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977216 | happy_node | Lamps (JOI19_lamps) | C++17 | 387 ms | 77960 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;
const int MX=2e6+5;
int N;
string A,B;
int dp[MX][8];
vector<pair<int,int>> adj[8];
bool can(int k, char s, char t) {
if(s=='#') return true;
assert(t!='#');
int a=s-'0',b=t-'0';
if(k==0) {
return a==b;
}
if(k==1) {
a^=1;
return a==b;
}
if(k==2) {
a=0;
a^=1;
return a==b;
}
if(k==3) {
a^=1;
a=0;
# | 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... |