oj.uz

답안 #212347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212347 2020-03-22T18:06:00 Z b00n0rp Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 3700 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
// #pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)\
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")\
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
 
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
 
// -----------------------</Consts>-----------------------
 
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
	fact[0] = 1;
	FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
	ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
	REPD(i,FACSZ-1){
		ifact[i] = mul(i+1,ifact[i+1],c);
	}
}
 
int ncr(int n,int r,int c = MOD){
	return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
	// (UNCOMMENT FOR CIN/COUT) \
	FAST_IO
	PRECISION(10)
 
	int t = 1;
	// (UNCOMMENT FOR MULTIPLE TEST CASES) \
	sfl(t);
	FOR(testcase,1,t+1){
		// (UNCOMMENT FOR CODEJAM) \
		printf("Case #%lld: ",testcase); 
		solvethetestcase();
	}
}   
 
int n,m;
vector<pair<pii,pii> > edges;
vi adj[205];
int dist[205][205];
int p1[205],p2[205];
int lol[205];

set<int> s;

int dijkstra(){
	REP(i,205) lol[i] = INF;
	lol[1] = 0;
	priority_queue<pii,vpii,greater<pii> > pq;
	pq.push({0,1});
	while(pq.size()){
		int u = pq.top().S;
		pq.pop();
		for(auto e:adj[u]){
			int v = edges[e].F.S,w = edges[e].S.F;
			if(lol[v] > lol[u]+w){
				lol[v] = lol[u]+w;
				pq.push({lol[v],v});
				p1[v] = e;
			}
		}
	}
	int res = lol[n];
	REP(i,205) lol[i] = INF;
	lol[n] = 0;
	pq.push({0,n});
	while(pq.size()){
		int u = pq.top().S;
		pq.pop();
		for(auto e:adj[u]){
			int v = edges[e].F.S,w = edges[e].S.F;
			if(lol[v] > lol[u]+w){
				lol[v] = lol[u]+w;
				pq.push({lol[v],v});
				p2[v] = e;
			}
		}
	}
	return res+lol[1];
}
 
void solvethetestcase(){
	sfl2(n,m)
	REP(i,205){
		p1[i] = -1;
		p2[i] = -1;
		REP(j,205){
			dist[i][j] = INF;
		}
		dist[i][i] = 0;
	}
	REP(i,m){
		int u,v,c,d;
		sfl2(u,v)
		sfl2(c,d)
		edges.pb({{u,v},{c,d}});
		adj[u].pb(i);
		adj[v].pb(i);
		remin(dist[u][v],c);
	}
	
	FOR(k,1,n+1){
		FOR(i,1,n+1){
			FOR(j,1,n+1){
				remin(dist[i][j],dist[i][k]+dist[k][j]); 
			}
		}
	}
	int ans = dist[1][n]+dist[n][1];
	dijkstra();
	// trace(dijkstra(),ans);
	FOR(i,1,n+1){
		// trace(i,p1[i],p2[i]);
		if(p1[i] != -1) s.insert(p1[i]);
		if(p2[i] != -1) s.insert(p2[i]);
	}
	REP(i,m){
		if(s.find(i) == s.end()){
			// trace(i,edges[i].S.S,dist[1][edges[i].F.S],dist[edges[i].F.F][n],edges[i].S.F);
			remin(ans,edges[i].S.S+min(dist[1][n],dist[1][edges[i].F.S]+dist[edges[i].F.F][n]+edges[i].S.F)+min(dist[n][1],dist[n][edges[i].F.S]+dist[edges[i].F.F][1]+edges[i].S.F));
		}
		else{
			swap(edges[i].F.F,edges[i].F.S);
			// trace(i,dijkstra(),edges[i].S.S);
			remin(ans,dijkstra()+edges[i].S.S);
			swap(edges[i].F.F,edges[i].F.S);
		}
	}
	if(ans > 1LL*(1e12)) pfi(-1)
	else pfl(ans)
}

Compilation message

ho_t4.cpp:4:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
 ^
ho_t4.cpp:6:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN NEEDED)\
 ^
ho_t4.cpp:56:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
ho_t4.cpp:212:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR CIN/COUT) \
  ^
ho_t4.cpp:217:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR MULTIPLE TEST CASES) \
  ^
ho_t4.cpp:220:3: warning: multi-line comment [-Wcomment]
   // (UNCOMMENT FOR CODEJAM) \
   ^
ho_t4.cpp: In function 'void solvethetestcase()':
ho_t4.cpp:96:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
ho_t4.cpp:272:2: note: in expansion of macro 'sfl2'
  sfl2(n,m)
  ^~~~
ho_t4.cpp:96:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
ho_t4.cpp:283:3: note: in expansion of macro 'sfl2'
   sfl2(u,v)
   ^~~~
ho_t4.cpp:96:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
ho_t4.cpp:284:3: note: in expansion of macro 'sfl2'
   sfl2(c,d)
   ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 768 KB Output is correct
2 Correct 14 ms 640 KB Output is correct
3 Correct 32 ms 768 KB Output is correct
4 Correct 35 ms 768 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 15 ms 640 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 37 ms 768 KB Output is correct
11 Correct 41 ms 768 KB Output is correct
12 Correct 40 ms 768 KB Output is correct
13 Correct 18 ms 768 KB Output is correct
14 Correct 25 ms 768 KB Output is correct
15 Correct 24 ms 768 KB Output is correct
16 Correct 26 ms 768 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 845 ms 3572 KB Output is correct
2 Correct 862 ms 3564 KB Output is correct
3 Correct 832 ms 3572 KB Output is correct
4 Correct 35 ms 768 KB Output is correct
5 Correct 23 ms 768 KB Output is correct
6 Correct 14 ms 768 KB Output is correct
7 Correct 13 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 252 ms 3572 KB Output is correct
10 Correct 219 ms 3572 KB Output is correct
11 Correct 573 ms 3572 KB Output is correct
12 Correct 553 ms 3572 KB Output is correct
13 Correct 506 ms 3572 KB Output is correct
14 Correct 423 ms 3688 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 768 KB Output is correct
2 Correct 14 ms 640 KB Output is correct
3 Correct 212 ms 3572 KB Output is correct
4 Correct 14 ms 640 KB Output is correct
5 Correct 261 ms 3572 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 102 ms 3692 KB Output is correct
9 Correct 114 ms 3572 KB Output is correct
10 Correct 184 ms 3572 KB Output is correct
11 Correct 169 ms 3572 KB Output is correct
12 Correct 186 ms 3572 KB Output is correct
13 Correct 5 ms 640 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 5 ms 640 KB Output is correct
19 Correct 189 ms 3572 KB Output is correct
20 Correct 161 ms 3572 KB Output is correct
21 Correct 179 ms 3572 KB Output is correct
22 Correct 172 ms 3572 KB Output is correct

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 768 KB Output is correct
2 Correct 14 ms 640 KB Output is correct
3 Correct 32 ms 768 KB Output is correct
4 Correct 35 ms 768 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 15 ms 640 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 37 ms 768 KB Output is correct
11 Correct 41 ms 768 KB Output is correct
12 Correct 40 ms 768 KB Output is correct
13 Correct 18 ms 768 KB Output is correct
14 Correct 25 ms 768 KB Output is correct
15 Correct 24 ms 768 KB Output is correct
16 Correct 26 ms 768 KB Output is correct
17 Correct 845 ms 3572 KB Output is correct
18 Correct 862 ms 3564 KB Output is correct
19 Correct 832 ms 3572 KB Output is correct
20 Correct 35 ms 768 KB Output is correct
21 Correct 23 ms 768 KB Output is correct
22 Correct 14 ms 768 KB Output is correct
23 Correct 13 ms 640 KB Output is correct
24 Correct 5 ms 640 KB Output is correct
25 Correct 252 ms 3572 KB Output is correct
26 Correct 219 ms 3572 KB Output is correct
27 Correct 573 ms 3572 KB Output is correct
28 Correct 553 ms 3572 KB Output is correct
29 Correct 506 ms 3572 KB Output is correct
30 Correct 423 ms 3688 KB Output is correct
31 Correct 24 ms 768 KB Output is correct
32 Correct 14 ms 640 KB Output is correct
33 Correct 212 ms 3572 KB Output is correct
34 Correct 14 ms 640 KB Output is correct
35 Correct 261 ms 3572 KB Output is correct
36 Correct 5 ms 640 KB Output is correct
37 Correct 4 ms 640 KB Output is correct
38 Correct 102 ms 3692 KB Output is correct
39 Correct 114 ms 3572 KB Output is correct
40 Correct 184 ms 3572 KB Output is correct
41 Correct 169 ms 3572 KB Output is correct
42 Correct 186 ms 3572 KB Output is correct
43 Correct 5 ms 640 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 5 ms 640 KB Output is correct
46 Correct 5 ms 640 KB Output is correct
47 Correct 5 ms 640 KB Output is correct
48 Correct 5 ms 640 KB Output is correct
49 Correct 189 ms 3572 KB Output is correct
50 Correct 161 ms 3572 KB Output is correct
51 Correct 179 ms 3572 KB Output is correct
52 Correct 172 ms 3572 KB Output is correct
53 Correct 922 ms 3572 KB Output is correct
54 Correct 973 ms 3572 KB Output is correct
55 Correct 919 ms 3572 KB Output is correct
56 Correct 34 ms 768 KB Output is correct
57 Correct 31 ms 768 KB Output is correct
58 Correct 537 ms 3700 KB Output is correct
59 Correct 666 ms 3572 KB Output is correct
60 Correct 942 ms 3572 KB Output is correct
61 Correct 511 ms 3572 KB Output is correct
62 Correct 622 ms 3572 KB Output is correct
63 Correct 914 ms 3572 KB Output is correct
64 Execution timed out 1094 ms 3572 KB Time limit exceeded
65 Halted 0 ms 0 KB -