| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 445646 | blue | Split the Attractions (IOI19_split) | C++17 | 51 ms | 3012 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 "split.h"
#include <vector>
using namespace std;
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
vector<int> res(n);
for(int i = 0; i < a; i++) res[i] = 1;
for(int i = a; i < a+b; i++) res[i] = 2;
for(int i = a+b; i < a+b+c; i++) res[i] = 3;
return res;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
