# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112270 | gs14004 | Lamps (JOI19_lamps) | C++17 | 88 ms | 23928 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 MAXN = 1000005;
using pi = pair<int, int>;
int n;
char s[MAXN], t[MAXN];
int dp[MAXN][5];
int getCost(int x, int p){
char c = x + '0';
if(c == '2') c = s[p];
return c != t[p];
}
int moveCost(int p1, int p2, int x1, int x2){
x1 /= 2, x2 /= 2;
int arg1 = getCost(x1, p1) != getCost(x2, p2);
int arg2 = x1 != x2;
return arg1 + arg2;
}
int adj[5][5] = {
{1, 0, 1, 0, 1},
{0, 1, 0, 1, 1},
{1, 0, 1, 0, 1},
{0, 1, 0, 1, 1},
{1, 0, 0, 1, 1}};
int main(){
Compilation message (stderr)
# | 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... |