# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
936507 | tamir1 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1092 ms | 22604 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 int
#define ff first
#define ss second
using namespace std;
ll n,m,i,j,dist[30005],b,p,x,y,R;
vector<ll> v[30005];
bitset<30005> vis;
map<ll,ll> mp;
set<pair<ll,ll>> q;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(i=0;i<m;i++){
cin >> b >> p;
v[b].push_back(p);
if(i==0) q.insert({0,b});
if(i==1) R=b;
}
while(!q.empty()){
pair<ll,ll> z=*q.begin();
x=z.ss;
y=z.ff;
q.erase(q.begin());
if(vis[x]) continue;
dist[x]=y;
vis[x]=1;
for(ll i:v[x]){
p=0;
for(b=x+i;b<n;b+=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... |