# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158548 | Mounir | Lamps (JOI19_lamps) | C++14 | 190 ms | 29916 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>
#define chmin(x, v) x = min(x, v)
using namespace std;
const int TAILLE_CHAINE = 1e6 + 1;
int dp[TAILLE_CHAINE][3][2];
int lenChaine;
bool depart[TAILLE_CHAINE], arrivee[TAILLE_CHAINE];
string d, a;
void litEntree();
void solve();
int main()
{
litEntree();
solve();
return 0;
}
void litEntree()
{
cin >> lenChaine;
cin.ignore();
getline(cin, d);
for (int idCara = 0; idCara < lenChaine; ++idCara){
depart[idCara] = d[idCara] - '0';
// cout << depart[idCara];
# | 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... |