# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
586471 | 2022-06-30T10:06:50 Z | krit3379 | City Mapping (NOI18_citymapping) | C++17 | 79 ms | 24652 KB |
#include<bits/stdc++.h> #include "citymapping.h" using namespace std; #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #define N 1005 struct A{ int a,b,w; }; long long dis[N][N],dis1[N],ma,id,last,last_node; vector<pair<long long,long long>> v,g[N]; vector<A> edge; bitset<N> vis; void dfs(int s,int f){ vis[s]=true; for(auto [x,w]:g[s]){ if(vis[x])continue; if(!f||dis[f][s]+dis[s][x]==dis[f][x])dfs(x,s),edge.push_back({s,x,w}); } } void find_roads(int n,int q,int a[], int b[],int w[]){ int i,j; if(q==500000){ for(i=1;i<=n;i++)for(j=i+1;j<=n;j++){ long long x=get_distance(i,j); dis[i][j]=dis[j][i]=x; g[i].push_back({j,x}); g[j].push_back({i,x}); } for(i=1;i<=n;i++)sort(g[i].begin(),g[i].end()); dfs(1,0); for(i=0;i<edge.size();i++){ a[i]=edge[i].a; b[i]=edge[i].b; w[i]=edge[i].w; printf("%d %d %d\n",a[i],b[i],w[i]); } } else if(q==12000){ for(i=2;i<=n;i++)dis1[i]=get_distance(1,i); for(i=1;i<=n;i++)if(dis1[i]>ma)ma=dis1[i],id=i; for(i=1;i<=n;i++)if(i!=id)v.push_back({get_distance(id,i),i}); sort(v.begin(),v.end()); last=0; last_node=id; for(i=0;i<v.size();i++){ a[i]=last_node; b[i]=v[i].second; w[i]=v[i].first-last; last=v[i].first; last_node=v[i].second; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 79 ms | 24652 KB | DO NOT PRINT ANYTHING TO STANDARD OUTPUT |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 79 ms | 24652 KB | DO NOT PRINT ANYTHING TO STANDARD OUTPUT |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 468 KB | Correct: 1980 out of 12000 queries used. |
2 | Correct | 2 ms | 496 KB | Correct: 1984 out of 12000 queries used. |
3 | Correct | 2 ms | 468 KB | Correct: 1998 out of 12000 queries used. |
4 | Correct | 2 ms | 468 KB | Correct: 1984 out of 12000 queries used. |
5 | Correct | 2 ms | 540 KB | Correct: 1980 out of 12000 queries used. |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 468 KB | Correct: 1980 out of 12000 queries used. |
2 | Correct | 2 ms | 496 KB | Correct: 1984 out of 12000 queries used. |
3 | Correct | 2 ms | 468 KB | Correct: 1998 out of 12000 queries used. |
4 | Correct | 2 ms | 468 KB | Correct: 1984 out of 12000 queries used. |
5 | Correct | 2 ms | 540 KB | Correct: 1980 out of 12000 queries used. |
6 | Correct | 1 ms | 468 KB | Correct: 1994 out of 12000 queries used. |
7 | Correct | 1 ms | 468 KB | Correct: 1990 out of 12000 queries used. |
8 | Correct | 2 ms | 468 KB | Correct: 1998 out of 12000 queries used. |
9 | Correct | 2 ms | 468 KB | Correct: 1992 out of 12000 queries used. |
10 | Correct | 1 ms | 468 KB | Correct: 1986 out of 12000 queries used. |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 79 ms | 24652 KB | DO NOT PRINT ANYTHING TO STANDARD OUTPUT |
2 | Halted | 0 ms | 0 KB | - |