結果
| 問題 | No.1341 真ん中を入れ替えて門松列 |
| ユーザー |
 rniya
|
| 提出日時 | 2021-01-15 22:48:48 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 8,380 bytes |
| コンパイル時間 | 2,386 ms |
| コンパイル使用メモリ | 227,888 KB |
| 実行使用メモリ | 11,008 KB |
| 最終ジャッジ日時 | 2024-05-05 00:49:21 |
| 合計ジャッジ時間 | 23,251 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | AC | 1 ms
5,376 KB |
| testcase_04 | AC | 2 ms
5,376 KB |
| testcase_05 | AC | 1 ms
5,376 KB |
| testcase_06 | AC | 11 ms
5,376 KB |
| testcase_07 | AC | 1,479 ms
5,376 KB |
| testcase_08 | AC | 15 ms
5,376 KB |
| testcase_09 | AC | 871 ms
5,632 KB |
| testcase_10 | TLE | - |
| testcase_11 | TLE | - |
| testcase_12 | AC | 1,916 ms
5,632 KB |
| testcase_13 | TLE | - |
| testcase_14 | TLE | - |
| testcase_15 | TLE | - |
| testcase_16 | TLE | - |
| testcase_17 | TLE | - |
| testcase_18 | AC | 1,155 ms
5,504 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};
template<typename T>
istream &operator>>(istream &is,vector<T> &v){
for (T &x:v) is >> x;
return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
for (int i=0;i<v.size();++i){
os << v[i] << (i+1==v.size()?"": " ");
}
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
os << '{';
for (auto itr=m.begin();itr!=m.end();){
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr!=m.end()) os << ',';
}
os << '}';
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
os << '{';
for (auto itr=m.begin();itr!=m.end();){
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr!=m.end()) os << ',';
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
os << '{';
for (auto itr=s.begin();itr!=s.end();){
os << *itr;
if (++itr!=s.end()) os << ',';
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
os << '{';
for (auto itr=s.begin();itr!=s.end();){
os << *itr;
if (++itr!=s.end()) os << ',';
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
os << '{';
for (auto itr=s.begin();itr!=s.end();){
os << *itr;
if (++itr!=s.end()) os << ',';
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
for (int i=0;i<v.size();++i){
os << v[i] << (i+1==v.size()?"": " ");
}
return os;
}
void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
cerr << head;
if (sizeof...(Tail)>0) cerr << ", ";
debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}
template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
if (a<b){a=b; return true;} return false;
}
#pragma endregion
template<typename T,typename E>
struct PrimalDual{
const E inf=numeric_limits<E>::max();
struct edge{
int to,rev; T cap; E cost;
edge(int to,T cap,E cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}
};
vector<vector<edge>> G;
vector<pair<int,int>> pos;
vector<E> h,dist;
vector<int> prevv,preve;
PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}
int add_edge(int from,int to,T cap,E cost){
pos.emplace_back(from,G[from].size());
G[from].emplace_back(to,cap,cost,G[to].size());
G[to].emplace_back(from,0,-cost,G[from].size()-1);
return pos.size()-1;
}
tuple<int,int,int,int,int> get_edge(int i){
auto e=G[pos[i].first][pos[i].second];
auto re=G[e.to][e.rev];
return {pos[i].first,e.to,e.cap+re.cap,re.cap,e.cost};
}
vector<tuple<int,int,int,int,int>> edges(){
vector<tuple<int,int,int,int,int>> res;
for (int i=0;i<pos.size();++i){
res.emplace_back(get_edge(i));
}
return res;
}
void dijkstra(int s){
struct P{
E c; int v;
P(E c,int v):c(c),v(v){}
bool operator<(const P &rhs) const {return c>rhs.c;}
};
priority_queue<P> pq;
fill(dist.begin(),dist.end(),inf);
dist[s]=0; pq.emplace(dist[s],s);
while(!pq.empty()){
auto p=pq.top(); pq.pop();
int v=p.v;
if (dist[v]<p.c) continue;
for (int i=0;i<G[v].size();++i){
auto &e=G[v][i];
if (e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){
dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];
prevv[e.to]=v; preve[e.to]=i;
pq.emplace(dist[e.to],e.to);
}
}
}
}
vector<pair<T,E>> slope(int s,int t,T lim){
T f=0; E c=0,pre=-1;
vector<pair<T,E>> res;
res.emplace_back(f,c);
while(f<lim){
dijkstra(s);
if (dist[t]==inf) break;
for (int v=0;v<G.size();++v) h[v]+=dist[v];
T d=lim-f;
for (int v=t;v!=s;v=prevv[v]){
d=min(d,G[prevv[v]][preve[v]].cap);
}
for (int v=t;v!=s;v=prevv[v]){
auto &e=G[prevv[v]][preve[v]];
e.cap-=d; G[v][e.rev].cap+=d;
}
f+=d; c+=h[t]*d;
if (pre==h[t]) res.pop_back();
res.emplace_back(f,c);
pre=c;
}
return res;
}
E min_cost_flow(int s,int t,T f){
auto res=slope(s,t,f).back();
return res.first==f?res.second:-1;
}
pair<T,E> min_cost_max_flow(int s,int t){
return slope(s,t,numeric_limits<T>::max()).back();
}
vector<pair<T,E>> min_cost_slope(int s,int t){
return slope(s,t,numeric_limits<T>::max());
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N; ll M; cin >> N >> M;
vector<int> A(N),B(N),C(N);
vector<pair<int,int>> Max,Min;
for (int i=0;i<N;++i){
cin >> A[i] >> B[i] >> C[i];
if (A[i]<C[i]) swap(A[i],C[i]);
Max.emplace_back(A[i],i);
Min.emplace_back(C[i],i);
}
sort(ALL(Max)); sort(ALL(Min));
// PrimalDual<int,ll> PD(4*N+2);
// int s=4*N,t=s+1;
// for (int i=0;i<N;++i){
// PD.add_edge(s,i,1,0);
// PD.add_edge(N+i,3*N+Max[i].second,1,0);
// PD.add_edge(2*N+i,3*N+Min[i].second,1,INF-A[Min[i].second]);
// PD.add_edge(3*N+i,t,1,0);
// for (int j=N-1;j>=0;--j){
// if (Max[j].first<B[i]){
// PD.add_edge(i,N+j,1,INF-B[i]);
// break;
// }
// }
// for (int j=0;j<N;++j){
// if (Min[j].first>B[i]){
// PD.add_edge(i,2*N+j,1,0);
// break;
// }
// }
// }
// for (int i=0;i<N-1;++i){
// PD.add_edge(N+i+1,N+i,N,0);
// PD.add_edge(2*N+i,2*N+i+1,N,0);
// }
PrimalDual<int,ll> PD(3*N+2);
int s=3*N,t=s+1;
for (int i=0;i<N;++i){
PD.add_edge(s,i,1,0);
PD.add_edge(N+i,t,1,0);
PD.add_edge(2*N+i,t,1,INF-A[Min[i].second]);
for (int j=N-1;j>=0;--j){
if (Max[j].first<B[i]){
PD.add_edge(i,N+j,1,INF-B[i]);
break;
}
}
for (int j=0;j<N;++j){
if (Min[j].first>B[i]){
PD.add_edge(i,2*N+j,1,0);
break;
}
}
}
for (int i=0;i<N-1;++i){
PD.add_edge(N+i+1,N+i,N,0);
PD.add_edge(2*N+i,2*N+i+1,N,0);
}
ll res=PD.min_cost_flow(s,t,N);
if (res<0){
cout << "NO" << '\n';
return 0;
}
cout << "YES" << '\n';
res=ll(INF)*N-res;
cout << (res>=M?"KADOMATSU!":"NO") << '\n';
}