# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398272 | mars | Three Friends (BOI14_friends) | C++14 | 58 ms | 7088 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.
/**
* A valid solution for task FRIENDS.
*
* Author: Marijonas Petrauskas
*/
#include <iostream>
#include <string>
using namespace std;
string try_candidate(const string &s, int orig_start, int orig_len, int modified_start) {
bool was_mismatch = false;
int orig = orig_start, mod = modified_start, i = 0;
while (i < orig_len) {
if (s[orig] != s[mod]) {
if (was_mismatch)
return string();
was_mismatch = true;
mod++;
} else
orig++, mod++, i++;
}
return s.substr(orig_start, orig_len);
}
int main() {
string final;
int N;
cin >> N;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |