# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169574 | CDuong | Inspections (NOI23_inspections) | C++20 | 105 ms | 24080 KiB |
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define isz(x) (int)x.size()
using namespace std;
void solve() {
int n, m, q;
cin >> n >> m >> q;
int cur = 0;
vector<i64> st(m);
vector<vector<int>> op(n + 1);
vector<array<int, 2>> a(m);
for (int i = 0; i < m; ++i) {
cin >> a[i][0] >> a[i][1];
st[i] = cur;
--a[i][0];
cur += a[i][1] - a[i][0];
op[a[i][0]].emplace_back(i);
op[a[i][1]].emplace_back(~i);
}
# | 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... |