oj.uz

Submission #448184

# Submission time Handle Problem Language Result Execution time Memory
448184 2021-07-29T07:02:15 Z BERNARB01 Dijamant (COI16_dijament) C++17
56 / 100
 434 ms 728 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	map<string, int> vis;
	vector<bitset<101>> anc(n + 1, 0);
	int id = 1;
	for (int i = 0; i < n; i++) {
		string tmp;
		getline(cin >> ws, tmp);
		stringstream ss;
		ss << tmp;
		string s, K;
		ss >> K;
		if (vis[K]) {
			cout << "greska" << '\n';
			continue;
		}
		ss >> s;
		vector<int> v;
		int bl = 1;
		while (1) {
			ss >> s;
			if (s == ";") {
				break;
			}
			if (!vis[s]) {
				bl = 0;
				break;
			}
			v.push_back(vis[s]);
		}
		if (!bl) {
			cout << "greska" << '\n';
			continue;
		}
		int m = v.size();
		for (int ii = 0; ii < m; ii++) {
			for (int j = ii + 1; j < m; j++) {
				if (anc[v[ii]][v[j]] || anc[v[j]][v[ii]]) {
					continue;
				}
				for (int k = 0; k < 101; k++) {
					if (anc[v[ii]][k] && anc[v[j]][k]) {
						bl = 0;
						break;
					}
				}
				if (!bl) {
					break;
				}
			}
			if (!bl) {
				break;
			}
		}
		if (!bl) {
			cout << "greska" << '\n';
			continue;
		}
		for (int ii = 0; ii < m; ii++) {
			anc[id] |= anc[v[ii]];
			anc[id][v[ii]] = 1;
		}
		vis[K] = id++;
		cout << "ok" << '\n';
	}
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 316 KB Output is correct

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 365 ms 452 KB Output is correct
2 Runtime error 434 ms 728 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -