oj.uz

Submission #239586

# Submission time Handle Problem Language Result Execution time Memory
239586 2020-06-16T13:38:04 Z MrRobot_28 Planinarenje (COCI18_planinarenje) C++17
48 / 160
 263 ms 20856 KB 
#include <bits/stdc++.h>
using namespace std;

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n, m;
	cin >> n >> m;
	vector <vector <int> > g(n);
	vector <vector <int> > g1(n);
	for(int i = 0; i < m; i++)
	{
		int a, b;
		cin >> a >> b;
		a--;
		b--;
		g[a].push_back(b);
		g1[b].push_back(a);
	}
	bool dp[(1 << n)][(1 << n)][n][2];
	for(int mask1 = (1 << n) - 1; mask1 >= 0; mask1--)
	{
		for(int mask2 = (1 << n) - 1; mask2 >= 0; mask2--)
		{
			for(int i = 0; i < n; i++)
			{
				for(int t = 0; t < 2; t++)
				{
					if(t == 0)
					{
						bool flag = false;
						for(int a = 0; a < g[i].size(); a++)
						{
							int to = g[i][a];
							if(((1 << to) & mask2) == 0 && !dp[mask1][mask2 | (1 << to)][to][1]){
								flag = true;
							}
						}
						dp[mask1][mask2][i][t] = flag;
					}
					else
					{
						bool flag = false;
						for(int b = 0; b < g1[i].size(); b++)
						{
							int to = g1[i][b];
							if(((1 << to) & mask1) == 0 && !dp[mask1 | (1 << to)][mask2][to][0])
							{
								flag = true;
							}
						}
						dp[mask1][mask2][i][t] = flag;
					}
				}
			}
		}
	}
	for(int i = 0; i < n; i++)
	{
		if(dp[(1 << i)][0][i][0])
		{
			cout << "Slavko\n";
		}
		else
		{
			cout << "Mirko\n";
		}
	}
    return 0;
}

Compilation message

planinarenje.cpp: In function 'int main()':
planinarenje.cpp:34:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int a = 0; a < g[i].size(); a++)
                      ~~^~~~~~~~~~~~~
planinarenje.cpp:46:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int b = 0; b < g1[i].size(); b++)
                      ~~^~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 20856 KB Output is correct
2 Correct 203 ms 20856 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 20856 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 1408 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 660 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -