# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1136394 | poat | Zalmoxis (BOI18_zalmoxis) | C++20 | 926 ms | 110020 KiB |
// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define mkp make_pair
#define txt freopen("kout.in", "r", stdin), freopen("kout.out", "w", stdout);
const int N = 2000, K = 20;
const int mod = 998244353;
void solve()
{
int n, k;
cin >> n >> k;
int mn = 1e9;
vector<pair<int, int>> vec(n);
vector<pair<int, int>> ans;
for(int i = 0; i < n; i++)
{
cin >> vec[i].first;
vec[i].second = i;
ans.push_back({vec[i].first, 0});
mn = min(mn, vec[i].first);
}
while(mn < 30)
{
vector<pair<int, int>> add;
vector<pair<int, int>> v2;
int c = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |