# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9703 | levant916 | Your life (kriii2_Y) | C++98 | 0 ms | 2068 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 <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
int dp[100001];
int M, N;
typedef pair<int, int> PAIR;
bool cmp(PAIR x, PAIR y) {
if (x.first < y.first){
return true;
}
else if (x.first == y.first) {
return x.second < y.second;
}
else {
return false;
}
}
int main(void) {
int x, y;
vector<PAIR> edge;
cin >> N >> M;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |