# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128616 | Rainmaker2627 | Port Facility (JOI17_port_facility) | C++20 | 0 ms | 320 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int exp(int a, int b, int mod) {
int x=1;
while (b) {
if (b%2) x=(x*a)%mod;
a=(a*a)%mod; b/=2;
} return x;
}
struct node {
int j, b=1;
node *nxt=nullptr, *prev=nullptr;
void init(int _j) { j=_j; }
};
signed main() {
// cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<pair<int, int>> s;
vector<int> a(n), b(n);
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
s.push_back({a[i], i+1});
s.push_back({b[i], -i-1});
} sort(s.begin(), s.end());
# | 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... |