oj.uz

답안 #447038

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447038 2021-07-24T09:36:22 Z hhhhaura From Hacks to Snitches (BOI21_watchmen) C++14
0 / 100
 84 ms 9272 KB 
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define ceil(a, b) ((a + b - 1) / (b))
#define all(x) x.begin(), x.end()

#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)

using namespace std;

#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19938 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) cerr << "Line " << __LINE__ << ": ", kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#else
#define print(...) 0
#define vprint(...) 0
#endif
namespace solver {
	int n;
	vector<pii> a;
	vector<vector<int>> mp;
	void init_(int _n) {
		n = _n;
		mp.assign(n + 1, vector<int>());
		a.assign(n + 1, {-1, -1});
	}
	int solve() {
		vector<int> dis(n + 1, INF);
		priority_queue<pii> q;
		dis[1] = 0, q.push({0, 1});
		while(q.size()) {
			pii p = q.top(); q.pop();
			if(p.first != dis[p.second]) continue;
			int cur = p.second;
			for(auto i : mp[cur]) {
				int v = dis[cur] + 1;
				if((v - 1) % a[i].first == a[i].second) continue;
				v += ((v % a[i].first) == a[i].second);
				if(v < dis[i]) {
					dis[i] = v;
					q.push({v, i});
				}
			}
		}
		return dis[n];
	}
	
};
using namespace solver;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n, m; 
	cin >> n >> m;
	init_(n);	
	rep(i, 1, m) {
		int a, b; cin >> a >> b;
		mp[a].push_back(b);
		mp[b].push_back(a);
	}
	int k; cin >> k;
	rep(i, 1, k) {
		int l; cin >> l;
		rep(j, 0, l - 1) {
			int x; cin >> x;
			a[x] = {l, j};
		}
 	}
 	cout << solve() << "\n";
	return 0;
}

Compilation message

watchmen.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
watchmen.cpp:24:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |             ^~~~
watchmen.cpp:24:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |                     ^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 2752 KB Output is correct
2 Incorrect 69 ms 9272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2636 KB Output is correct
2 Incorrect 84 ms 9232 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2636 KB Output is correct
2 Incorrect 84 ms 9232 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2636 KB Output is correct
2 Incorrect 84 ms 9232 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 2752 KB Output is correct
2 Incorrect 69 ms 9272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 2752 KB Output is correct
2 Incorrect 69 ms 9272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 2752 KB Output is correct
2 Incorrect 69 ms 9272 KB Output isn't correct
3 Halted 0 ms 0 KB -