# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952547 | ParsaGolestani | Sparklers (JOI17_sparklers) | C++17 | 366 ms | 11292 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;
typedef long long ll;
const int N = 100'000;
const ll INF = 10'000'000'000;
ll n, k, t, s, x[N + 10];
stack<ll> a, b;
void readInput() {
cin >> n >> k >> t;
for (int i = 1; i <= n; i++)
cin >> x[i];
}
stack<ll> empSt() {
stack<ll> st;
return st;
}
stack<ll> revSt(stack<ll> st) {
stack<ll> res;
while (st.size()) {
res.push(-st.top());
st.pop();
}
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |