# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1137430 | poat | Zalmoxis (BOI18_zalmoxis) | C++20 | 925 ms | 53936 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<int> arr;
vector<int> vec(n);
for(auto &i : vec)
{
cin >> i;
arr.push_back(i);
mn = min(mn, i);
}
while(mn < 30)
{
vector<int> add;
double cnt = 0;
for(int i = 0; i < vec.size(); i++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |