# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302147 | edenooo | 역사적 조사 (JOI14_historical) | C++17 | 4029 ms | 63148 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.
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
const int SQ = 316;
struct Node {
int l, r, i;
bool operator<(Node &n)
{
if (l/SQ != n.l/SQ) return l/SQ < n.l/SQ;
return r < n.r;
}
};
int N, Q;
int A[100101], B[100101];
ll res[100101], cost[100101];
vector<Node> q;
priority_queue<ll> pq, del;
vector<int> com;
int main()
{
scanf("%d %d", &N, &Q);
for(int i=1; i<=N; i++)
{
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... |