Submission #1401404
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;
const int MAX_V = 510; //必要な頂点数
struct Flow{
struct edge{
int to, cap, rev;
};
vector<edge> G[MAX_V];//隣接リスト
bool used[MAX_V];
void add_edge(int from, int to, int cap){
G[from].push_back((edge){to, cap, (int)G[to].size()});//from -> to
G[to].push_back((edge){from, 0, (int)G[from].size() - 1});//to -> from
}
//増加パスを探す
int dfs(int v, int t, int f){
if(v == t) return f;
used[v] = true;
for (int i = 0; i < G[v].size(); ++i){
edge &e = G[v][i];
if(!used[e.to] && e.cap > 0){
int d = dfs(e.to, t, min(f, e.cap));
if(d > 0){
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
//sからtへの最大流
int max_flow(int s, int t){
int flow = 0;
while(1){
memset(used, 0, sizeof(used));
int f = dfs(s, t, INF);
if(f == 0) return flow;
flow += f;
}
}
};
int N, M, P, G;
int L[12];
int from[510], to[510], cap[510];
int main(void) {
cin >> N >> M >> P >> G;
rep(i, G) cin >> L[i];
rep(i, N) cin >> from[i] >> to[i] >> cap[i];
Flow f;
int start = N + 1;
rep(i, G) f.add_edge(start, L[i], INF);
rep(i, N) f.add_edge(from[i], to[i], cap[i]);
int ret = f.max_flow(start, 0);
if(ret < P) printf("No\n");
else printf("Yes\n");
return 0;
}
Submission Info
Submission Time |
|
Task |
H - お風呂は気持ちいい |
User |
mmxsrup |
Language |
C++14 (GCC 5.4.1) |
Score |
140 |
Code Size |
2030 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
f1t |
basic |
Score / Max Score |
40 / 40 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
f1t |
f1t/basic_case00, f1t/basic_case01, f1t/basic_case02, f1t/basic_case03, f1t/basic_case04, f1t/basic_case05, f1t/basic_case06, f1t/basic_case07, f1t/basic_case08, f1t/basic_case09, f1t/sample00, f1t/sample01, f1t/sample02 |
basic |
basic/basic_case00, basic/basic_case01, basic/basic_case02, basic/basic_case03, basic/basic_case04, basic/basic_case05, basic/basic_case06, basic/basic_case07, basic/basic_case08, basic/basic_case09, basic/corner00, basic/sample00, basic/sample01, basic/sample02 |
Case Name |
Status |
Exec Time |
Memory |
sample00 |
AC |
1 ms |
256 KB |
sample01 |
AC |
1 ms |
256 KB |
sample02 |
AC |
1 ms |
256 KB |
basic/basic_case00 |
AC |
1 ms |
256 KB |
basic/basic_case01 |
AC |
2 ms |
256 KB |
basic/basic_case02 |
AC |
1 ms |
256 KB |
basic/basic_case03 |
AC |
1 ms |
256 KB |
basic/basic_case04 |
AC |
2 ms |
256 KB |
basic/basic_case05 |
AC |
1 ms |
256 KB |
basic/basic_case06 |
AC |
1 ms |
256 KB |
basic/basic_case07 |
AC |
1 ms |
256 KB |
basic/basic_case08 |
AC |
2 ms |
256 KB |
basic/basic_case09 |
AC |
1 ms |
256 KB |
basic/corner00 |
AC |
1 ms |
256 KB |
basic/sample00 |
AC |
1 ms |
256 KB |
basic/sample01 |
AC |
1 ms |
256 KB |
basic/sample02 |
AC |
1 ms |
256 KB |
f1t/basic_case00 |
AC |
1 ms |
256 KB |
f1t/basic_case01 |
AC |
1 ms |
256 KB |
f1t/basic_case02 |
AC |
1 ms |
256 KB |
f1t/basic_case03 |
AC |
1 ms |
256 KB |
f1t/basic_case04 |
AC |
1 ms |
256 KB |
f1t/basic_case05 |
AC |
1 ms |
256 KB |
f1t/basic_case06 |
AC |
1 ms |
256 KB |
f1t/basic_case07 |
AC |
1 ms |
256 KB |
f1t/basic_case08 |
AC |
1 ms |
256 KB |
f1t/basic_case09 |
AC |
1 ms |
256 KB |
f1t/sample00 |
AC |
1 ms |
256 KB |
f1t/sample01 |
AC |
1 ms |
256 KB |
f1t/sample02 |
AC |
1 ms |
256 KB |