# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528073 | koioi.org-koosaga | From Hacks to Snitches (BOI21_watchmen) | C++17 | 6071 ms | 194768 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long lint;
typedef pair<lint, lint> pi;
const int mod = 1e9 + 7;
const int MAXN = 250005;
vector<lint> dist[MAXN];
vector<int> gph[MAXN];
struct node{
int x, y; lint dist;
bool operator<(const node &n)const{
return dist > n.dist;
}
};
void solve(int n, vector<pi> edg, vector<int> v, int s, int e){
for(auto &[u, v] : edg){
gph[u].push_back(v);
gph[v].push_back(u);
}
for(int i = 0; i < n; i++) sort(all(gph[i]));
int p = 0;
vector<pi> cycs;
for(int i = 0; i < sz(v); i++){
for(int j = 0; j < v[i]; j++){
dist[p].resize(v[i], 1e18);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |