oj.uz

답안 #512102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
512102 2022-01-16T06:42:43 Z PoPularPlusPlus Tales of seafaring (POI13_mor) C++17
100 / 100
 2025 ms 66936 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const ll mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n , m;
	cin >> n >> m;
	int k;
	cin >> k;
	vector<int> adj[n + 1];
	for(int i = 0; i < m; i++){
		int a,b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	vector<pair<pair<int,int> , pair<int,int>>> v;
	for(int i = 0; i < k; i++){
		int a , b;
		cin >> a >> b;
		int c;
		cin >> c;
		v.pb(mp(mp(a,b) , mp(c,i)));
	}
	sv(v);
	//cout << "came" << endl;
	int dis[n + 1][2];
	int pos = 0;
	string ans[k];
	for(int i = 1; i <= n; i++){
		memset(dis,-1,sizeof dis);
		dis[i][0] = 0;
		queue<pair<int,int>> q;
		q.push(mp(i,0));
		while(q.size()){
			pair<int,int> node = q.front();
			q.pop();
			for(int j : adj[node.vf]){
				if(dis[j][(node.vs + 1) % 2] == -1){
					dis[j][(node.vs + 1) % 2] = dis[node.vf][node.vs] + 1;
					q.push(mp(j,(node.vs + 1)%2));
				}
			}
		}
		while(pos < k && v[pos].vf.vf == i){
			if(dis[v[pos].vf.vs][v[pos].vs.vf % 2] == -1 || dis[v[pos].vf.vs][v[pos].vs.vf % 2] > v[pos].vs.vf || adj[v[pos].vf.vs].size() == 0){
				ans[v[pos].vs.vs] = "NIE\n";
			}
			else ans[v[pos].vs.vs] = "TAK\n";
			pos++;
		}
	}
	//cout << "came" << endl;
	for(auto i : ans)cout << i;
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen("rblock.in", "r", stdin);
//freopen("rblock.out", "w", stdout);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 523 ms 66936 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 538 ms 66832 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 464 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 19 ms 332 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 964 KB Output is correct
2 Correct 9 ms 972 KB Output is correct
3 Correct 55 ms 980 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 1476 KB Output is correct
2 Correct 10 ms 724 KB Output is correct
3 Correct 293 ms 1048 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 843 ms 51524 KB Output is correct
2 Correct 16 ms 588 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1669 ms 51672 KB Output is correct
2 Correct 100 ms 10740 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1705 ms 51760 KB Output is correct
2 Correct 214 ms 16040 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2025 ms 51692 KB Output is correct
2 Correct 484 ms 38948 KB Output is correct