# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1126013 | _rain_ | Voting Cities (NOI22_votingcity) | C++20 | 868 ms | 5220 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int>ii;
#define fi first
#define se second
#define name "main"
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define FORD(i,a,b) for(int i=(b);i>=(a);--i)
#define N 5'00'0
const LL INF=(LL)1e18;
vector<ii>ke[N+2];
void add_canh(int u,int v,int c){
ke[u].push_back({v,c}); return;
}
struct Point{
LL cost;
int u;
int i1,i2,i3,i4,i5;
bool operator <(const Point&other) const{
return cost>other.cost;
}
};
int cnt[6]={};
LL d[N+2][2][2][2][2][2],p[6]={},price[6]={};
bool voting[N+2];
int n,m,k;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |