# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45506 | dqhungdl | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 592 ms | 162532 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;
const int lim=1e3;
typedef pair<int,int> ii;
int n,m,S,T,d[30005][1005];
bool Visited[30005],Free[30005][1005];
map<int,int> dd[30005];
map<int,bool> FFree[30005];
vector<int> g[30005];
queue<ii> Q;
int main()
{
ios_base::sync_with_stdio(false);
//freopen("TEST.INP","r",stdin);
cin>>n>>m;
int pos,step;
for(int i=1;i<=m;i++)
{
cin>>pos>>step;
g[pos+1].push_back(step);
if(i==1)
S=pos+1;
if(i==2)
T=pos+1;
}
for(int i=0; i<g[S].size(); i++)
{
if(g[S][i]<=lim)
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... |