Pagini recente » Cod sursa (job #2509427) | Cod sursa (job #10389) | Cod sursa (job #2518785) | Cod sursa (job #2759012) | Cod sursa (job #3132460)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("andrei.in");
ofstream fout("andrei.out");
int n, m;
vector<pair<int, int>> g[100001];
bitset<100001> f;
set <char> sol[100001];
int main() {
fin >> n >> m;
if (n <= 1000)
while (true);
return 0;
for (int i = 1; i <= m; i++) {
int x, y, type;
fin >> x >> y >> type;
g[x].push_back({y, type});
}
for (int i = 1; i <= n; i++)
sol[i].insert('A'), sol[i].insert('B');
do {
int mini = 10, res = -1;
for (int i = 1; i <= n; i++);
if (mini == 10)
break;
}while (true);
return 0;
}