| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1363821 | activedeltorre | Sphinx's Riddle (IOI24_sphinx) | C++20 | 28 ms | 660 KiB |
#include "sphinx.h"
#include <cassert>
#include <cstdio>
#include <queue>
#include <string>
#include <vector>
#include <iostream>
using namespace std;
int perform_experiment(std::vector<int> E);
vector<int>make(int n,int poz,int val)
{
std::vector<int> E(n);
for(int i=0;i<n;i++)
{
E[i]=val;
}
E[poz]=-1;
return E;
}
std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y)
{
std::vector<int> E(N, -1);
vector<int>rasp(N);
int n=N;
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
int rez=perform_experiment(make(N,i,j));
if(rez==1)
{
rasp[i]=j;
}
}
}
return rasp;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
