oj.uz

답안 #343030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343030 2021-01-03T11:18:16 Z AmineWeslati 악어의 지하 도시 (IOI11_crocodile) C++14
89 / 100
 708 ms 51924 KB 
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

#ifndef LOCAL
#include "crocodile.h"
#endif

int N;
vpi adj[MX]; 

pair<ll,ll> upd(ll v, pair<ll,ll> p){
	if(v<p.fi){
		swap(p.fi,p.se);
		p.fi=v;
	}
	else p.se=v;
	return p;
}


int travel_plan(int NN, int M, int R[][2], int L[], int K, int P[]){
	N=NN;
	FOR(i,0,M){
		int u=R[i][0],v=R[i][1];
		adj[u].pb({v,L[i]});
		adj[v].pb({u,L[i]});
	}
	
	pair<ll,ll> dist[N]; FOR(i,0,N) dist[i]={INF,INF};
	priority_queue<pair<ll,int>,V<pair<ll,int>>,greater<pair<ll,int>>> q;

	FOR(i,0,K){
		int u=P[i];
		dist[u]={0,0};
		q.push({0,u});
	}

	bool checked[N];
	while(!q.empty()){
		int u=q.top().se; ll d=q.top().fi;
		q.pop();
		if(d>dist[u].se) continue;
		for(auto v: adj[u]) if(d+v.se < dist[v.fi].se){
			dist[v.fi]=upd(d+v.se,dist[v.fi]);
			q.push({dist[v.fi].se,v.fi});
		}
	}
	return dist[0].se;
}



#ifdef LOCAL
int main() {
    boost; IO();

    int N,M,K; cin>>N>>M>>K;
    int R[M][2],L[M];
    FOR(i,0,M) cin>>R[i][0]>>R[i][1]>>L[i];
    int P[K];
    FOR(i,0,K) cin>>P[i];
    cout << travel_plan(N,M,R,L,K,P) << endl;
    

    return 0;
}
#endif

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:99:7: warning: unused variable 'checked' [-Wunused-variable]
   99 |  bool checked[N];
      |       ^~~~~~~

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 2796 KB Output is correct
5 Correct 3 ms 2796 KB Output is correct
6 Correct 2 ms 2796 KB Output is correct
7 Correct 2 ms 2796 KB Output is correct
8 Correct 3 ms 2796 KB Output is correct
9 Correct 5 ms 2924 KB Output is correct
10 Correct 3 ms 2668 KB Output is correct
11 Correct 3 ms 2836 KB Output is correct
12 Correct 7 ms 3180 KB Output is correct
13 Correct 8 ms 3180 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 4 ms 2796 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 2796 KB Output is correct
5 Correct 3 ms 2796 KB Output is correct
6 Correct 2 ms 2796 KB Output is correct
7 Correct 2 ms 2796 KB Output is correct
8 Correct 3 ms 2796 KB Output is correct
9 Correct 5 ms 2924 KB Output is correct
10 Correct 3 ms 2668 KB Output is correct
11 Correct 3 ms 2836 KB Output is correct
12 Correct 7 ms 3180 KB Output is correct
13 Correct 8 ms 3180 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 4 ms 2796 KB Output is correct
16 Correct 567 ms 44688 KB Output is correct
17 Correct 111 ms 13600 KB Output is correct
18 Correct 148 ms 14948 KB Output is correct
19 Correct 708 ms 51924 KB Output is correct
20 Correct 341 ms 36716 KB Output is correct
21 Correct 63 ms 7272 KB Output is correct
22 Incorrect 378 ms 32764 KB Output isn't correct