oj.uz

답안 #448442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448442 2021-07-30T07:39:29 Z fuad27 KOVANICE (COI15_kovanice) C++14
50 / 100
 2000 ms 27716 KB 
#include<bits/stdc++.h>
using namespace std;
#define MAXN 300005
 
vector<int> eq[MAXN];
int n, m, k;
vector<int> adjList[MAXN];
int counts[MAXN];
int compress[MAXN];
int ans[MAXN];
 
void fill(int src, int val) {
	compress[src] = val;
	for (auto i : eq[src]) {
		if (compress[i] == -1) {
			fill(i, val);
		}
	}
}
 
void dfs(int src, int depth) {
	for (auto i : adjList[src]) {
		if (ans[compress[i]] == -1) {
			dfs(i, depth + 1);
		}
	}
	if (depth == n) {
		ans[compress[src]] = 1;
		return;
	}
	for (auto i : adjList[src]) {
		if (ans[compress[i]] != -1) {
			ans[compress[src]] = ans[compress[i]] + 1;
			return;
		}
	}
}
 
int main() {
	cin >> n >> m >> k;
	
	for (int i = 0; i <= m; i++) {
		counts[i] = 0;
		compress[i] = -1;
		ans[i] = -1;
	}
	for (int i = 0; i < k; i++) {
		string s;
		cin >> s;
		int node1 = 0;
		int node2 = 0;
		bool found = false;
		char mark;
		for (int a = 0; a < s.size(); a++) {
			if (s[a] == '=' || s[a] == '<' || s[a] == '>') {
				found = true;
				mark = s[a];
				continue;
			}
			if (found == false) {
				node1 = node1 * 10 + (s[a] - 48);
			}
			else {
				node2 = node2 * 10 + (s[a] - 48);
			}
		}
		if (mark == '=') {
			eq[node1].push_back(node2);
			eq[node2].push_back(node1);
			continue;
		}
		if (mark == '<') {
			swap(node1, node2);
		}
		adjList[node1].push_back(node2);
		counts[node2]++;
	}
	int counter = 1;
	for (int i = 1; i <= m; i++) {
		if (compress[i] == -1) {
			fill(i, counter);
			counter++;
		}
	}
	for (int i = 1; i <= m; i++) {
		if (counts[i] == 0) {
			dfs(i, 1);
		}
	}
	for (int i = 1; i <= m; i++) {
		if (ans[compress[i]] != -1) {
			cout << "K";
			cout << ans[compress[i]] << endl;
		}
		else {
			cout << "?" << endl;
		}
	}
}

Compilation message

kovanice.cpp: In function 'int main()':
kovanice.cpp:54:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |   for (int a = 0; a < s.size(); a++) {
      |                   ~~^~~~~~~~~~
kovanice.cpp:72:3: warning: 'mark' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |   if (mark == '<') {
      |   ^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14352 KB Output is correct
2 Correct 12 ms 14376 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 434 ms 20696 KB Output is correct
2 Correct 411 ms 20504 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2088 ms 15044 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2098 ms 27716 KB Time limit exceeded
2 Halted 0 ms 0 KB -