| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1260171 | Seyyed_Mojtaba_Mortazavi | 코알라 (APIO17_koala) | C++20 | 8 ms | 432 KiB |
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 10;
int minValue(int n, int w)
{
int B[n];
int R[n];
memset(B, 0, sizeof(B));
B[0] = 1;
playRound(B, R);
for (int i = 0; i < n; i++)
{
if (B[i] >= R[i])
return i;
}
}
int maxValue(int n, int w)
{
int B[n];
int R[n];
vector <int> mx;
for (int i = 0; i < n; i++)
mx.push_back(i);
while (mx.size() > 1)
{
memset(B, 0, sizeof(B));
int tmp = w / mx.size();
for (auto i : mx)
B[i] = tmp;
playRound(B, R);
mx.clear();
for (int i = 0; i < n; i++)
{
if (R[i] > tmp)
mx.push_back(i);
}
}
return mx[0];
}
int greaterValue(int n, int w)
{
int B[n];
int R[n];
memset(B, 0, sizeof(B));
int l = 1, r = 8;
while (r - l > 1)
{
int mid = (l + r) >> 1;
B[0] = B[1] = mid;
playRound(B, R);
if (R[0] > B[0] && R[1] > B[1])
l = mid;
else if (R[0] <= B[0] && R[1] <= B[1])
r = mid;
else
return R[0] < R[1];
}
}
void allValues(int n, int w, int *p)
{
}컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
