oj.uz

Submission #91504

# Submission time Handle Problem Language Result Execution time Memory
91504 2018-12-27T21:52:51 Z jasony123123 Dijamant (COI16_dijament) C++11
100 / 100
 654 ms 19676 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"

typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }

void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */

#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}

const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
/*****************************16 COI 1***********************************/


map<string, int> nodes;
v<int> adj[1000];

bool dfs(int x, v<int> &seen, int color) {
	if (seen[x] == color) return 1;
	if (seen[x] != -1) return 0;
	seen[x] = color;
	for (int c : adj[x]) if (!dfs(c, seen, color)) return 0;
	return 1;
}

bool add(v<string> &data) {
	if (nodes.find(data[0]) != nodes.end()) return 0;
	v<int> par;
	FOR(i, 1, data.size()) {
		if (nodes.find(data[i]) == nodes.end()) return 0;
		else par.push_back(nodes[data[i]]);
	}
	sort(all(par)), reverse(all(par));

	v<int> seen(nodes.size(), -1);
	for (int p : par) {
		if (seen[p] != -1) continue;
		if (!dfs(p, seen, p)) return 0;
	}

	int cur = nodes.size();
	nodes[data[0]] = cur;
	adj[cur] = par;
	return 1;
}

v<string> read() {
	v<string> ret;
	string temp;
	cin >> temp;
	while (temp != ";") {
		if(temp!=":")
			ret.push_back(temp);
		cin >> temp;
	}
	return ret;
}

int main() {
	io();
	int n;
	cin >> n;
	FOR(i, 0, n) {
		v<string> line = read();
		if (add(line))
			cout << "ok\n";
		else
			cout << "greska\n";
	}
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 2 ms 736 KB Output is correct
4 Correct 2 ms 736 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 2 ms 736 KB Output is correct
4 Correct 2 ms 736 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 2 ms 1020 KB Output is correct
9 Correct 2 ms 1020 KB Output is correct
10 Correct 2 ms 1020 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 2 ms 736 KB Output is correct
4 Correct 2 ms 736 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 2 ms 1020 KB Output is correct
9 Correct 2 ms 1020 KB Output is correct
10 Correct 2 ms 1020 KB Output is correct
11 Correct 2 ms 1020 KB Output is correct
12 Correct 2 ms 1020 KB Output is correct
13 Correct 2 ms 1020 KB Output is correct
14 Correct 2 ms 1020 KB Output is correct
15 Correct 3 ms 1020 KB Output is correct
16 Correct 2 ms 1020 KB Output is correct
17 Correct 2 ms 1020 KB Output is correct
18 Correct 2 ms 1020 KB Output is correct
19 Correct 2 ms 1020 KB Output is correct
20 Correct 2 ms 1040 KB Output is correct
21 Correct 2 ms 1048 KB Output is correct
22 Correct 2 ms 1152 KB Output is correct
23 Correct 2 ms 1240 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 560 ms 6752 KB Output is correct
2 Correct 654 ms 11716 KB Output is correct
3 Correct 58 ms 13256 KB Output is correct
4 Correct 3 ms 13256 KB Output is correct
5 Correct 4 ms 13256 KB Output is correct
6 Correct 7 ms 13296 KB Output is correct
7 Correct 12 ms 13592 KB Output is correct
8 Correct 23 ms 13828 KB Output is correct
9 Correct 24 ms 14188 KB Output is correct
10 Correct 6 ms 14304 KB Output is correct
11 Correct 6 ms 14408 KB Output is correct
12 Correct 505 ms 19676 KB Output is correct