제출 #471971

#제출 시각아이디문제언어결과실행 시간메모리
471971NhatMinh0208철로 (IOI14_rail)C++14
30 / 100
120 ms60740 KiB
#ifndef CPL_TEMPLATE #define CPL_TEMPLATE /* Normie's Template v2.5 Changes: Added warning against using pragmas on USACO. */ // Standard library in one include. #include <bits/stdc++.h> using namespace std; // ordered_set library. #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update> // AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.) //#include <atcoder/all> //using namespace atcoder; //Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.) #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //File I/O. #define FILE_IN "cseq.inp" #define FILE_OUT "cseq.out" #define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout) //Fast I/O. #define fio ios::sync_with_stdio(0);cin.tie(0) #define nfio cin.tie(0) #define endl "\n" //Order checking. #define ord(a,b,c) ((a>=b)and(b>=c)) //min/max redefines, so i dont have to resolve annoying compile errors. #define min(a,b) (((a)<(b))?(a):(b)) #define max(a,b) (((a)>(b))?(a):(b)) // Fast min/max assigns to use with AVX. // Requires g++ 9.2.0. template<typename T> __attribute__((always_inline)) void chkmin(T& a, const T& b) { a=(a<b)?a:b; } template<typename T> __attribute__((always_inline)) void chkmax(T& a, const T& b) { a=(a>b)?a:b; } //Constants. #define MOD (ll(998244353)) #define MAX 300001 #define mag 320 const long double PI=3.14159265358979; //Pairs and 3-pairs. #define p1 first #define p2 second.first #define p3 second.second #define fi first #define se second #define pii(element_type) pair<element_type,element_type> #define piii(element_type) pair<element_type,pii(element_type)> //Quick power of 2. #define pow2(x) (ll(1)<<x) //Short for-loops. #define ff(i,__,___) for(int i=__;i<=___;i++) #define rr(i,__,___) for(int i=__;i>=___;i--) //Typedefs. #define bi BigInt typedef long long ll; typedef long double ld; typedef short sh; // Binpow and stuff ll BOW(ll a, ll x, ll p) { if (!x) return 1; ll res=BOW(a,x/2,p); res*=res; res%=p; if (x%2) res*=a; return res%p; } ll INV(ll a, ll p) { return BOW(a,p-2,p); } //---------END-------// #endif int n,m,i,j,k,t,t1,u,v,a,b; #include "rail.h" int dis[5001][5001]; int isD[1000001]; int isC[1000001]; set<int> sC,sD; int gd(int i, int j){ if (dis[i][j]) return dis[i][j]; dis[i][j]=getDistance(i,j); dis[j][i]=dis[i][j]; return dis[i][j]; } void findLocation(int N, int first, int location[], int stype[]) { vector<int> lmao,l,r; for (i=1;i<N;i++) lmao.push_back(i); int A,X,Y,Z,D; sort (lmao.begin(),lmao.end(),[](int a,int b) { return (gd(0,a)<gd(0,b)); }); X=lmao[0]; location[0]=first; location[X]=first+gd(0,X); stype[0]=1; stype[X]=2; sD.insert(location[X]); sC.insert(location[0]); for (i=1;i<lmao.size();i++) { Z=lmao[i]; if (gd(X,Z)<gd(X,0)) { location[Z]=location[X]-gd(X,Z); stype[Z]=1; } else if (gd(X,Z)<gd(0,Z)) l.push_back(Z); else r.push_back(Z); } A=X; Y=0; for (auto Z : l) { D=-gd(A,Z)+gd(A,Y)+gd(Y,Z); D/=2; u=location[Y]+D; v=u+(gd(A,Z)-(location[A]-u)); a=1; auto it1=sC.lower_bound(u); if (it1!=sC.end() && (*(it1))==u) { it1++; if (it1==sC.end() || (*(it1))>v) { a=1; } else a=0; } else a=0; if (a) { stype[Z]=2; location[Z]=v; sD.insert(location[Z]); } else { stype[Z]=1; location[Z]=location[A]-gd(A,Z); sC.insert(location[Z]); Y=Z; } } A=0; Y=X; for (auto Z : r) { D=-gd(A,Z)+gd(A,Y)+gd(Y,Z); D/=2; u=location[Y]-D; v=u-(gd(A,Z)-(u-location[A])); a=1; auto it1=sD.lower_bound(u); if (it1!=sD.end() && (*(it1))==u) { if (it1 == sD.begin()) a=1; else { it1--; if ((*(it1))>=v) a=0; else a=1; } } else a=0; if (a) { stype[Z]=1; location[Z]=v; sC.insert(location[Z]); } else { stype[Z]=2; location[Z]=location[A]+gd(A,Z); sD.insert(location[Z]); Y=Z; } } // for (i=0;i<N;i++) cout<<location[i]<<' '; cout<<endl; // for (i=0;i<N;i++) cout<<stype[i]<<' '; cout<<endl; } // Normie28;

컴파일 시 표준 에러 (stderr) 메시지

rail.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:132:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     for (i=1;i<lmao.size();i++) {
      |              ~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...