# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62926 | MatheusLealV | Treasure (different grader from official contest) (CEOI13_treasure2) | C++17 | 3 ms | 1004 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 "treasure.h"
#include <bits/stdc++.h>
using namespace std;
int ans[150][150], col[150], n;
void solve(int l, int r, int k)
{
if(!k) return;
if(l == r) col[l] = k;
else
{
int mid = (l + r)/2;
int A = countTreasure(1, l, n, mid);
solve(l, mid, A), solve(mid + 1, r, k - A);
}
}
void solve2(int id, int l, int r, int k)
{
if(!k) return;
if(k == r - l + 1)
{
for(int i = l; i <= r; i++) ans[i][id] = 1;
return;
}
if(l == r) ans[l][id] = k;
else
{
int mid = (l + r)/2;
int A = countTreasure(l, id, mid, id);
solve2(id, l, mid, A), solve2(id, mid + 1, r, k - A);
}
}
void findTreasure (int N)
{
n = N;
solve(1, N, countTreasure(1, 1, N, N));
for(int i = 1; i <= N; i++) solve2(i, 1, N, col[i]);
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
{
if(ans[i][j]) Report(i, j);
}
// cout<<"COLUNA "<<i<<" = "<<col[i]<<"\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |