# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1120204 | RSAMSD | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 280 ms | 96428 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
int t = 0;
int const f = 2e3 + 10;
long long mod = 1e9 + 7;//998244353;
long long dp1[f];
long long dp2[f];
long long par[f];
long long a[f];
long long adj[f][f];
long long mmn =0;
pair<long long, long long> edges[f];
long long prefix[f];
vector<pair<long long,long long>>g[f];
vector<pair<int,int>>gg[f];
struct node {
long long val = 0;
long long lazy = 0;
};
struct trpel {
long long v, u, bank = 0;
};
node segtree[f * 8];
bool B[f];
void redany() {
ifstream fin;
ofstream fout;
fin.open("std.in");
fout.open("std.out");
}
void build(int v , int l , int r){
if(r==l){
segtree[v].val = 1e9;
return;
}
int mid = (r+l)/2;
build(2*v+1,mid+1,r);
build(2*v,l,mid);
segtree[v].val = max(segtree[v*2].val,segtree[2*v+1].val);
}
void upd(int v, int l, int r , int pos, int val){
if(r==l&&r==pos){
segtree[v].val = val;
return;
}
int mid = (r+l)/2;
if(pos>mid){
upd(2*v+1,mid+1,r,pos,val);
}
else{
upd(2*v,l,mid,pos,val);
}
segtree[v].val = max(segtree[v*2].val,segtree[2*v+1].val);
}
long long q(int v, int tl , int tr , int l ,int r){
if(tl>r||tr<l)return 0;
if(tr<=r&&tl>=l){
return segtree[v].val;
}
int mid = (tr+tl)/2;
return max(q(2*v,tl,mid,l,r),q(2*v+1,mid+1,tr,l,r));
}
// void merge(int a , int b, int n, int id){
// if(g[a].size()>g[b].size()){
// swap(a,b);
// }
// for(int u:g[a]){
// if(u<n&&!B[u]&&par[u+1]==b){
// upd(1,1,n,u,id);
// B[u]=1;
// }
// if(u>1&&!B[u-1]&&par[u-1]==b){
// upd(1,1,n,u-1,id);
// B[u-1] =1;
// }
// g[b].push_back(u);
// par[u] = b;
// }
// }
long long powmod(long long a, long long p, long long modd) {
long long ans = 1;
while (p > 0) {
if (p % 2 == 1) {
ans *= a;
ans %= modd;
p--;
}
if (p == 0)break;
a *= a;
a %= modd;
p /= 2;
}
return ans;
}
long long tw = powmod(2, mod - 2, mod);
int main() {
ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//cin >> t;
t = 1;
for (int hhh = 1;hhh <= t;hhh++) {
long long n, mx = 0, d = 0, m = 0, k = 0, k2 = 0, r = 0, rr = 0, l = 0, ll = 0, lll = 0, rrr = 0, inf = 1e18;
string s1;
string s3;
char s2;
long double dec = 0;
bool c = 1;
priority_queue<pair<long long, long long>> qq;
multiset<long long> mul;
queue<long long> pp;
map<pair<long long, pair<long long, long long>>, long long> conv;
vector<long long> vec;
cin >> n >> m;
for(int i =0;i<m;i++){
cin>>r>>l;
for(int j = r+l;j<n;j+=l){
if(adj[r][j]==0){
adj[r][j] = (j-r)/l;
continue;
}
adj[r][j] = min(adj[r][j],(j-r)/l);
}
for(int j = r-l;j>-1;j-=l){
if(adj[r][j]==0){
adj[r][j] = (r-j)/l;
continue;
}
adj[r][j] = min(adj[r][j],(r-j)/l);
}
if(i==0){
k2 = r;
}
if(i==1)lll = r;
}
for(int i = 0;i<n;i++){
for(int j =0;j<n;j++){
if(adj[i][j]!=0){
g[i].push_back({j,adj[i][j]});
}
}
}
qq.push({0,k2});
fill(dp2,dp2+n,1e17);
dp2[k2] = 0;
while(!qq.empty()){
d = qq.top().second;
qq.pop();
if(B[d])continue;
B[d]=1;
for(auto u:g[d]){
if(dp2[u.first]>dp2[d]+u.second){
dp2[u.first] = dp2[d]+u.second;
qq.push({-dp2[u.first],u.first});
}
}
}
k = dp2[lll];
if(k!=1e17)
cout<<k;
else
cout<<-1;
}
}
컴파일 시 표준 에러 (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... |