結果
| 問題 | No.519 アイドルユニット |
| ユーザー |
|
| 提出日時 | 2017-05-28 22:48:39 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,071 bytes |
| コンパイル時間 | 3,590 ms |
| コンパイル使用メモリ | 233,196 KB |
| 実行使用メモリ | 4,348 KB |
| 最終ジャッジ日時 | 2023-10-21 14:27:41 |
| 合計ジャッジ時間 | 4,586 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,348 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | AC | 1 ms
4,348 KB |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | AC | 2 ms
4,348 KB |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:67:9: warning: no return statement in function returning non-void [-Wreturn-type]
67 | }
| ^
ソースコード
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
namespace {
std::chrono::system_clock::time_point ttt;
void tic() { ttt = TIME; }
void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - ttt)); }
std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
}
#ifdef __MAI //_getchar_nolock
#define getchar_unlocked getchar
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
public:
template<typename T>
void input_integer(T& var) {
var = 0;
T sign = 1;
int cc = getchar_unlocked();
for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
if (cc == '-') sign = -1;
for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
var = (var << 3) + (var << 1) + cc - '0';
var = var*sign;
}
inline int c() { return getchar_unlocked(); }
inline MaiScanner& operator>>(int& var) {
input_integer<int>(var);
return *this;
}
inline MaiScanner& operator>>(long long& var) {
input_integer<long long>(var);
return *this;
}
inline MaiScanner& operator>>(string& var) {
int cc = getchar_unlocked();
for (; !isvisiablechar(cc); cc = getchar_unlocked());
for (; isvisiablechar(cc); cc = getchar_unlocked())
var.push_back(cc);
}
};
}
MaiScanner scanner;
class Flow {
public:
size_t n;
struct Arrow {
int from, to;
int w_max;
int cap;
Arrow(int from = 0, int to = 0, int w = 1) :from(from), to(to), w_max(w), cap(w) {}
bool operator<(const Arrow& a) const { return (from<a.from) | (to<a.to) | (w_max<a.w_max) | (cap<a.cap); }
bool operator==(const Arrow& a) const { return (from == a.from) && (to == a.to) && (w_max == a.w_max) && (cap == a.cap); }
};
vector<vector<int>> vertex_to;
vector<vector<int>> vertex_from;
vector<Arrow> arrow;
Flow(int n, int m = 5010) :n(n), vertex_to(n), vertex_from(n) { arrow.reserve(m); }
void connect(int from, int to, int left) {
vertex_to[from].push_back(arrow.size()); // toto
vertex_from[to].push_back(arrow.size()); // fromfrom
arrow.emplace_back(from, to, left);
}
size_t degree(int v) {
return vertex_to[v].size() + vertex_from[v].size();
}
size_t degree_in(int v) {
return vertex_from[v].size();
}
size_t degree_out(int v) {
return vertex_to[v].size();
}
};
// DAG
int _dinic_path_dfs(Flow& flow, vector<int>& result, vector<int>& flag, const vector<int>& dist, int u, int i_sink, int mini) {
// TODO: 経路再利用
if (i_sink == u) return mini;
if (flag[u]) return -1;
flag[u] = true;
int sumw = 0;
bool term = true;
for (int e : flow.vertex_to[u]) {
Flow::Arrow& a = flow.arrow[e];
if (a.w_max > 0 && dist[u]>dist[a.to]) {
int w;
if (mini < 0)
w = a.w_max;
else
w = min(a.w_max, mini);
w = _dinic_path_dfs(flow, result, flag, dist, a.to, i_sink, w);
if (w == -1) continue;
a.w_max -= w;
result[a.to] += w;
sumw += w;
mini -= w;
term = false;
flag[u] = false; // TODO: 末尾では?
if (mini == 0) return term ? -1 : sumw;
}
}
for (int e : flow.vertex_from[u]) {
Flow::Arrow& a = flow.arrow[e];
if (a.cap>a.w_max && dist[u]>dist[a.from]) {
int w;
if (mini < 0)
w = a.cap - a.w_max;
else
w = min(a.cap - a.w_max, mini);
w = _dinic_path_dfs(flow, result, flag, dist, a.from, i_sink, w);
if (w == -1) continue;
a.w_max += w;
result[a.to] -= w;
sumw += w;
mini -= w;
term = false;
flag[u] = false;
if (mini == 0) return term ? -1 : sumw;
}
}
return term ? -1 : sumw;
}
// flowは書き換えられる．
void dinic(Flow &flow, vector<int>& result, int i_source, int i_sink) {
assert(i_source != i_sink);
result.resize(flow.n);
int distbegin = 0;
vector<int> dist(flow.n);
queue<int> q;
vector<int> flag(flow.n);
for (int distbegin = 0; ; distbegin += flow.n) {
q.emplace(i_sink); // bfsはsinkからsourceへの距離を計算．
dist[i_sink] = distbegin + 1;
while (!q.empty()) {
int v = q.front();
q.pop();
for (int ie : flow.vertex_from[v]) {
const Flow::Arrow& e = flow.arrow[ie];
if (0<e.w_max && dist[e.from] <= distbegin) {
dist[e.from] = dist[v] + 1;
q.emplace(e.from);
}
}
for (int ie : flow.vertex_to[v]) {
const Flow::Arrow& e = flow.arrow[ie];
if (e.w_max<e.cap && dist[e.to] <= distbegin) {
dist[e.to] = dist[v] + 1;
q.emplace(e.to);
}
}
}
//debugv(dist);
fill(ALL(flag), false);
if (dist[i_source] <= distbegin) {
break;
}
else {
result[i_source] += _dinic_path_dfs(flow, result, flag, dist, i_source, i_sink, -1);
}
}
}
class BipartiteMatching {
public:
Flow flow;
int n, m;
int ss;
BipartiteMatching(int n, int m) :flow(2 + n + m), n(n), m(m), ss(n + m) {
for (int i = 0; i<n; i++)
flow.connect(ss, i, 1);
for (int i = 0; i<m; i++)
flow.connect(n + i, ss + 1, 1);
}
void connect(int l, int r) {
flow.connect(l, r + n, 1);
}
int solve_dinic(set<Flow::Arrow>& result) {
int count = 0;
vector<int> r;
dinic(flow, r, ss, ss + 1);
for (Flow::Arrow& a : flow.arrow) {
if (a.from == ss || a.to == ss + 1) continue;
if (a.w_max == 0) {
result.insert(a);
count++;
}
}
return count;
}
};
int width, height;
int m, n, kei;
int main() {
scanner >> n;
Flow g(n*2 + 2);
int l = n * 2;
for (int i = 0; i < n; ++i) {
int h = 0;
for (int j = 0; j < n; ++j) {
int k;
scanner >> k;
h = max(h, k);
if (i == j) continue;
g.connect(i, n + j, k);
}
g.connect(l, i, h);
g.connect(n + i, l + 1,h);
}
vector<int>dam;
dinic(g, dam, l, l + 1);
cout << dam[l + 1]/2 << endl;
return 0;
}