oj.uz

답안 #471908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
471908 2021-09-11T16:11:19 Z NhatMinh0208 철로 (IOI14_rail) C++14
30 / 100
 123 ms 67568 KB 
#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];
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;
    isD[location[X]]=1;
    isC[location[0]]=1;
    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;
            isC[location[Z]]=1;
        } else if (gd(X,Z)<gd(0,Z)) l.push_back(Z);
          else r.push_back(Z);
    }
    sort(l.begin(), l.end(),[X](int a, int b){
        return gd(X,a)<gd(X,b);
    });
    A=X;
    Y=0;
    sort(r.begin(), r.end(),[](int a, int b){
        return gd(0,a)<gd(0,b);
    });
    for (auto Z : l) {
        D=-gd(A,Z)+gd(A,Y)+gd(Y,Z);
        D/=2;
        if (isC[location[Y]+D]) {
            stype[Z]=2;
            u=location[Y]+D;
            location[Z]=u+(gd(A,Z)-(location[A]-u));
            isD[location[Z]]=1;
        } else {
            stype[Z]=1;
            location[Z]=location[A]-gd(A,Z);
            isC[location[Z]]=1;
            Y=Z;
        }
    }
    A=0;
    Y=X;
    for (auto Z : r) {
        D=-gd(A,Z)+gd(A,Y)+gd(Y,Z);
        D/=2;
        if (isD[location[Y]-D]) {
            stype[Z]=1;
            u=location[Y]-D;
            location[Z]=u-(gd(A,Z)-(u-location[A]));
            isC[location[Z]]=1;
        } else {
            // cout<<A<<' '<<gd(A,Z)<<' '<<endl;
            stype[Z]=2;
            location[Z]=location[A]+gd(A,Z);
            isD[location[Z]]=1;
            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;

Compilation message

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:129:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |     for (i=1;i<lmao.size();i++) {
      |              ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 1 ms 844 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 844 KB Output is correct
6 Correct 1 ms 844 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 756 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 1 ms 844 KB Output is correct

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 63044 KB Output is correct
2 Correct 114 ms 58024 KB Output is correct
3 Correct 123 ms 67568 KB Output is correct
4 Correct 118 ms 67268 KB Output is correct
5 Correct 114 ms 67200 KB Output is correct
6 Incorrect 107 ms 45948 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 63052 KB Output is correct
2 Correct 110 ms 58104 KB Output is correct
3 Correct 118 ms 67568 KB Output is correct
4 Correct 115 ms 67196 KB Output is correct
5 Correct 112 ms 67192 KB Output is correct
6 Incorrect 104 ms 45932 KB Output isn't correct
7 Halted 0 ms 0 KB -