# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853510 | lolismek | Restore Array (RMI19_restore) | C++14 | 557 ms | 41260 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 <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#define pii pair <int, int>
using namespace std;
const int NMAX = 5001;
const int INF = 1e9 + 1;
vector <pii> adj[NMAX + 1];
int d[NMAX + 1];
bool inq[NMAX + 1];
int f[NMAX + 1];
int ans[NMAX + 1];
int main(){
int n, m;
cin >> n >> m;
for(int i = 1; i <= m; i++){
int l, r, k, v;
cin >> l >> r >> k >> v;
++l, ++r;
# | 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... |