# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699441 | aelf2k23 | 초음속철도 (OJUZ11_rail) | C++14 | 3100 ms | 7888 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>
#define int long long
#define ll long long
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
using namespace std;
const int nmax = 400005;
const int mod = 1e9 + 7;
int n, m, dp[nmax];
pair<int,int> a[nmax];
vector<int>vecc;
int32_t main(){
cin >> n >> m;
for(int i=1;i<=m;i++){
cin >> a[i].fr >> a[i].sc;
swap(a[i].fr, a[i].sc);
vecc.push_back(a[i].fr);
vecc.push_back(a[i].sc);
}
vecc.push_back(n);
sort(all(vecc));
vecc.resize(unique(all(vecc)) - vecc.begin());
# | 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... |