# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135931 | model_code | Graphic Madness (CERC12_K) | C++17 | 213 ms | 956 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.
// CERC 2012
// Problem K: Graphic Madness
// Model solution, O(n)
// Author: Jakub Pachocki
#include <iostream>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int decode(const string& name, int k, int n, int m) {
int result = 0;
char card;
char type;
stringstream ss(name);
ss >> card >> type >> result;
--result;
if (type == 'P') {
result += k;
}
if (card == 'B') {
result += k + n;
}
return result;
}
string encode(int x, int k, int n, int m) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |