# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
392974 | giorgikob | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1 ms | 1044 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 ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N = 3e4+5, mod = 1e9+7, sq = 500;
int n,m;
set<pair<int,int>>s;
int D[N];
int X[N],P[N];
int F[N];
vector<int>V[N];
inline void test_case(){
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>X[i]>>P[i];
X[i]++;
V[X[i]].push_back(i);
}
for(int i=1;i<=m;i++){
if(i>1){
D[i] = 1e9;
//s.insert({1e9,i});
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |