| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 119881 |
2019-06-22T14:31:52 Z |
tutis |
Trapezi (COI17_trapezi) |
C++17 |
|
500 ms |
27436 KB |
/*input
3
.000000
...000000
.....000000
.....0.....
...000...
.00000.
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
struct grupe
{
int x, y, z;
bool reikia = false;
};
vector<grupe>xx;
vector<char>col;
unordered_set<bitset<54>>M;
bool ieskom(bitset<54>x)
{
if (x.count() == 0)
return true;
if (M.count(x))
return false;
for (int i = 0; i < (int)xx.size(); i++)
{
if (x[xx[i].x] && x[xx[i].y] && x[xx[i].z])
{
x[xx[i].x] = false;
x[xx[i].y] = false;
x[xx[i].z] = false;
xx[i].reikia = true;
if (ieskom(x))
{
return true;
}
xx[i].reikia = false;
x[xx[i].x] = true;
x[xx[i].y] = true;
x[xx[i].z] = true;
}
}
M.insert(x);
return false;
}
int main()
{
int n;
cin >> n;
string s[2 * n];
for (int i = 0; i < 2 * n; i++)
cin >> s[i];
vector<int>id[2 * n];
int timer = 0;
for (int i = 0; i < 2 * n; i++)
for (char c : s[i])
{
id[i].push_back(timer++);
col.push_back(c);
}
vector<int>adj[timer];
for (int i = 0; i < 2 * n; i++)
{
for (int t = 0; t + 1 < (int)id[i].size(); t++)
{
int x = id[i][t];
int y = id[i][t + 1];
adj[x].push_back(y);
adj[y].push_back(x);
}
}
for (int i = 0; i <= n - 2; i++)
{
for (int t = 0; t < (int)id[i].size(); t += 2)
{
int x = id[i][t];
int y = id[i + 1][t + 1];
adj[x].push_back(y);
adj[y].push_back(x);
}
}
for (int t = 0; t < (int)id[n - 1].size(); t += 2)
{
int x = id[n - 1][t];
int y = id[n][t];
adj[x].push_back(y);
adj[y].push_back(x);
}
for (int i = n + 1; i < 2 * n; i++)
{
for (int t = 0; t < (int)id[i].size(); t += 2)
{
int x = id[i][t];
int y = id[i - 1][t + 1];
adj[x].push_back(y);
adj[y].push_back(x);
}
}
for (int i = 0; i < timer; i++)
{
for (int j : adj[i])
{
for (int k : adj[i])
{
if (j < k)
{
grupe a;
a.x = i;
a.y = j;
a.z = k;
xx.push_back(a);
}
}
}
}
bitset<54>x;
for (int i = 0; i < 2 * n; i++)
{
for (int t = 0; t < (int)id[i].size(); t++)
{
if (s[i][t] == '0')
x[id[i][t]] = true;
}
}
if (ieskom(x))
{
for (grupe a : xx)
{
if (a.reikia == false)
continue;
set<int>aplink;
for (int i : {a.x, a.y, a.z})
for (int j : adj[i])
aplink.insert(j);
for (int i : {a.x, a.y, a.z})
aplink.erase(i);
set<char>cols;
for (int i : aplink)
cols.insert(col[i]);
for (char x = '1'; x <= '6'; x++)
if (cols.count(x) == 0)
{
col[a.x] = x;
col[a.y] = x;
col[a.z] = x;
}
}
for (int i = 0; i < 2 * n; i++)
{
for (int t = 0; t < (int)id[i].size(); t++)
{
cout << col[id[i][t]];
}
cout << endl;
}
}
else
cout << "nemoguce\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1070 ms |
25616 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1067 ms |
27436 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1070 ms |
24940 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
