Cod sursa(job #2275348)
| Utilizator | Data | 3 noiembrie 2018 08:44:52 | |
|---|---|---|---|
| Problema | Arbore partial de cost minim | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.22 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
vector < pair <int,int> > v[200002];
priority_queue <pair <int,pair<int,int> > > h[200002];
int main()
{
return 0;
}
