| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1216138 | Muhammad_Aneeq | Art Collections (BOI22_art) | C++20 | 767 ms | 476 KiB |
#include "art.h"
#include <vector>
using namespace std;
void solve(int n)
{
vector<int>ans(n);
for (int i=1;i<=n;i++)
{
vector<int>cur;
cur.push_back(i);
for (int j=1;j<=n;j++)
if (j!=i)
cur.push_back(j);
int z=publish(cur);
cur={};
for (int j=1;j<=n;j++)
if (j!=i)
cur.push_back(j);
cur.push_back(i);
int y=publish(cur);
for (int j=0;j<=n-1;j++)
{
int g=z-j+(n-1-j);
if (g==y)
{
ans[j]=i;break;
}
}
}
answer(ans);
}
| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
