# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
632224 | gs14004 | Bread First Search (CCO21_day2problem2) | C++17 | 2086 ms | 5584 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;
using lint = long long;
using pi = pair<int, int>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
const int MAXN = 1005;
const int mod = 1e9 + 7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> L(n, 1e9), R(n, -1e9), dp(n + 1), nxt(n, 1e9);
for(int i = 0; i < m; i++){
int u, v; cin >> u >> v;
u--; v--;
if(u > v) swap(u, v);
R[u] = max(R[u], v);
L[v] = min(L[v], u);
}
for(int i = 0; i < n; i++){
nxt[i] = R[i];
if(i) nxt[i] = max(nxt[i], nxt[i - 1]);
}
vector<pi> swp;
for(int i = 0; i < n; i++) swp.emplace_back(min(i, L[i]), i);
sort(all(swp));
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... |