Submission #3019230
Source Code Expand
#include <cstdio>
#include <queue>
using namespace std;
const int N=200005;
const int INF=1e9;
int n,m;
int a[N][2];
inline int max(int x,int y){
return x>y?x:y;
}
inline int min(int x,int y){
return x<y?x:y;
}
namespace DINIC{/*{{{*/
const int S=N*4;
const int M=N*10; //N*4+N+N+N*2;
int flow_s,flow_t;
int dis[S],cur[S];
int h[S],tot;
struct Edge{
int v,f,next;
}e[M*2];
void init(int _flow_s,int _flow_t){
flow_s=_flow_s; flow_t=_flow_t;
tot=1;
}
void addEdge(int u,int v,int f){
//printf("%d %d %d\n",u,v,f);
e[++tot]=(Edge){v,f,h[u]}; h[u]=tot;
e[++tot]=(Edge){u,0,h[v]}; h[v]=tot;
}
queue<int> q;
bool bfs(){
for(int i=1;i<=flow_t;i++)
dis[i]=-1,cur[i]=h[i];
while(!q.empty()) q.pop();
q.push(flow_s);
dis[flow_s]=1;
while(!q.empty()){
int u=q.front();
q.pop();
for(int i=h[u],v;i;i=e[i].next)
if(e[i].f&&dis[v=e[i].v]==-1){
dis[v]=dis[u]+1;
//if(v==flow_t) return true;
q.push(v);
}
}
return dis[flow_t]!=-1;
}
int dfs(int u,int flow){
if(u==flow_t)
return flow;
int get,res=0;
for(int i=cur[u],v;i&&flow;i=e[i].next)
if(e[i].f&&dis[v=e[i].v]==dis[u]+1){
get=dfs(v,min(flow,e[i].f));
e[i].f-=get;
e[i^1].f+=get;
if(e[i].f) cur[u]=i;
flow-=get;
res+=get;
}
if(!res) dis[u]=-1;
return res;
}
int solve(){
int res=0;
while(bfs())
res+=dfs(flow_s,INF);
return res;
}
}/*}}}*/
void readData(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d%d",&a[i][0],&a[i][1]);
a[i][0]=max(a[i][0],1);
a[i][1]=min(a[i][1],m);
}
}
void buildGraph(){
for(int i=1;i<=m;i++){
if(i<m){
DINIC::addEdge(i,i+1,m-i);
DINIC::addEdge(m+i+1,m+i,i);
}
DINIC::addEdge(i,2*m+i,1);
DINIC::addEdge(m+i,2*m+i,1);
DINIC::addEdge(2*m+i,DINIC::flow_t,1);
}
for(int i=1;i<=n;i++){
DINIC::addEdge(DINIC::flow_s,3*m+i,1);
DINIC::addEdge(3*m+i,m+a[i][0],1);
DINIC::addEdge(3*m+i,a[i][1],1);
}
}
int main(){
readData();
DINIC::init(3*m+n+1,3*m+n+2);
buildGraph();
int match=DINIC::solve();
printf("%d\n",n-match);
return 0;
}
Submission Info
Submission Time
2018-08-17 12:22:45+0900
Task
F - Exhausted?
User
RogerDTZ
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
2175 Byte
Status
WA
Exec Time
2104 ms
Memory
68332 KB
Compile Error
./Main.cpp: In function ‘void readData()’:
./Main.cpp:75:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:77:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&a[i][0],&a[i][1]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 1000
Status
Set Name
Test Cases
Sample
s1.txt, s2.txt, s3.txt, s4.txt
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name
Status
Exec Time
Memory
01.txt
AC
1205 ms
44416 KB
02.txt
AC
409 ms
46208 KB
03.txt
TLE
2104 ms
52992 KB
04.txt
TLE
2104 ms
52992 KB
05.txt
AC
26 ms
22912 KB
06.txt
AC
778 ms
44160 KB
07.txt
AC
291 ms
36480 KB
08.txt
TLE
2104 ms
52992 KB
09.txt
AC
482 ms
38400 KB
10.txt
AC
190 ms
41784 KB
11.txt
AC
95 ms
48664 KB
12.txt
AC
73 ms
48000 KB
13.txt
AC
85 ms
32280 KB
14.txt
AC
103 ms
32280 KB
15.txt
AC
96 ms
52760 KB
16.txt
AC
505 ms
44656 KB
17.txt
AC
1344 ms
68200 KB
18.txt
AC
1498 ms
68332 KB
19.txt
AC
1629 ms
54784 KB
20.txt
AC
1745 ms
56808 KB
21.txt
AC
472 ms
43392 KB
22.txt
AC
1243 ms
53992 KB
23.txt
AC
103 ms
23168 KB
24.txt
AC
1481 ms
68328 KB
25.txt
WA
57 ms
48000 KB
26.txt
WA
46 ms
33664 KB
27.txt
TLE
2104 ms
63072 KB
28.txt
TLE
2104 ms
49596 KB
29.txt
TLE
2104 ms
65276 KB
30.txt
TLE
2104 ms
65280 KB
31.txt
TLE
2104 ms
52992 KB
32.txt
TLE
2104 ms
51968 KB
33.txt
TLE
2104 ms
54508 KB
34.txt
TLE
2104 ms
43704 KB
35.txt
TLE
2104 ms
47488 KB
36.txt
TLE
2104 ms
55664 KB
37.txt
AC
3 ms
8448 KB
38.txt
AC
3 ms
8448 KB
39.txt
AC
3 ms
8448 KB
40.txt
AC
3 ms
8448 KB
41.txt
AC
3 ms
8448 KB
42.txt
WA
3 ms
8448 KB
43.txt
AC
18 ms
37120 KB
44.txt
WA
3 ms
8448 KB
s1.txt
AC
3 ms
8448 KB
s2.txt
AC
3 ms
8448 KB
s3.txt
AC
3 ms
8448 KB
s4.txt
AC
3 ms
8448 KB