# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889160 | dimashhh | Feast (NOI19_feast) | C++17 | 291 ms | 29552 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 <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 1, MOD = 998244353;
typedef long long ll;
#define int long long
int n, k, a[N],p[N];
bool ok[N];
vector<ll> b, sum(N);
set<int> pos;
set<pair<ll,ll>> st;
ll res = 0,col = 0;
void del(int i){
if(i >= 0 && i < n){
st.erase({abs(sum[i]),i});
pos.erase(i);
ok[i] = 1;
if(sum[i] >= 0){
res -= sum[i];
col--;
}
}
}
void test()
{
cin >> n >> k;
ll lst = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
ok[i] = (a[i] >= 0);
Compilation message (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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |