Submission #60293030
Source Code Expand
#include<bits/stdc++.h>
#include"atcoder/all"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll inf=1ll<<61;
typedef modint1000000007 mi;
ll ax[20005],bx[20005],ay[20005],by[20005];
ll dx[]={1,1,0,-1,-1,-1,0,1},dy[]={0,1,1,1,0,-1,-1,-1};
int main(){
ll n,t;cin>>n>>t;
rep(i,n)cin>>ax[i]>>ay[i];
rep(i,n)cin>>bx[i]>>by[i];
map<P,int>M;
rep(i,n)M[{bx[i],by[i]}]=i+n;
mf_graph<ll>graph(2*n+2);
rep(i,n){
rep(j,8){
ll mx=ax[i]+dx[j]*t,my=ay[i]+dy[j]*t;
if(M.count({mx,my}))graph.add_edge(i,M[{mx,my}],1);
}
}
rep(i,n){
graph.add_edge(2*n,i,1);
graph.add_edge(n+i,2*n+1,1);
}
if(graph.flow(2*n,2*n+1)==n){
cout<<"Yes"<<endl;
auto vec=graph.edges();
vector<int>ans(n);
for(auto &e:vec){
if(e.flow==1&&e.from<n){
ll cx=bx[e.to-n]-ax[e.from];
ll cy=by[e.to-n]-ay[e.from];
cx/=t;
cy/=t;
rep(j,8){
if(cx==dx[j]&&cy==dy[j])ans[e.from]=j+1;
}
}
}
rep(i,n){
if(i)cout<<" ";cout<<ans[i];
}cout<<endl;
}
else{
cout<<"No"<<endl;
}
}
Submission Info
Submission Time
2024-11-30 15:39:35+0900
Task
077 - Planes on a 2D Plane(★7)
User
Rho17
Language
C++ 20 (gcc 12.2)
Score
7
Code Size
1237 Byte
Status
AC
Exec Time
346 ms
Memory
27804 KiB
Compile Error
Main.cpp: In function ‘int main()’:
Main.cpp:55:25: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
55 | if(i)cout<<" ";cout<<ans[i];
| ^~
Main.cpp:55:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
55 | if(i)cout<<" ";cout<<ans[i];
| ^~~~
Judge Result
Set Name
Sample
Subtask1
Subtask2
Subtask3
Subtask4
Score / Max Score
0 / 0
1 / 1
1 / 1
2 / 2
3 / 3
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt, sample_03.txt
Subtask1
sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sample_01.txt, sample_02.txt
Subtask2
sub3_01.txt, sub3_02.txt, sub3_03.txt, sub3_04.txt, sub3_05.txt, sub3_06.txt, sub3_07.txt, sub3_08.txt, sub3_09.txt, sub3_10.txt
Subtask3
sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub4_01.txt, sub4_02.txt, sub4_03.txt, sub4_04.txt, sub4_05.txt, sub4_06.txt, sub4_07.txt, sample_01.txt, sample_02.txt, sample_03.txt
Subtask4
sample_01.txt, sample_02.txt, sample_03.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub3_01.txt, sub3_02.txt, sub3_03.txt, sub3_04.txt, sub3_05.txt, sub3_06.txt, sub3_07.txt, sub3_08.txt, sub3_09.txt, sub3_10.txt, sub4_01.txt, sub4_02.txt, sub4_03.txt, sub4_04.txt, sub4_05.txt, sub4_06.txt, sub4_07.txt, sub5_01.txt, sub5_02.txt, sub5_03.txt, sub5_04.txt, sub5_05.txt, sub5_06.txt, sub5_07.txt, sub5_08.txt, sub5_09.txt, sub5_10.txt, sub5_11.txt, sub5_12.txt, sub5_13.txt, sub5_14.txt, sub5_15.txt, sub5_16.txt, sub5_17.txt, sub5_18.txt, sub5_19.txt, sub5_20.txt, sub5_21.txt, sub5_22.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
1 ms
3600 KiB
sample_02.txt
AC
1 ms
3672 KiB
sample_03.txt
AC
1 ms
3560 KiB
sub1_01.txt
AC
1 ms
3600 KiB
sub1_02.txt
AC
1 ms
3672 KiB
sub1_03.txt
AC
1 ms
3548 KiB
sub1_04.txt
AC
1 ms
3556 KiB
sub1_05.txt
AC
1 ms
3516 KiB
sub1_06.txt
AC
1 ms
3608 KiB
sub1_07.txt
AC
1 ms
3476 KiB
sub1_08.txt
AC
1 ms
3472 KiB
sub1_09.txt
AC
1 ms
3588 KiB
sub1_10.txt
AC
1 ms
3536 KiB
sub3_01.txt
AC
38 ms
11500 KiB
sub3_02.txt
AC
37 ms
11424 KiB
sub3_03.txt
AC
40 ms
11464 KiB
sub3_04.txt
AC
38 ms
11552 KiB
sub3_05.txt
AC
39 ms
11944 KiB
sub3_06.txt
AC
35 ms
10208 KiB
sub3_07.txt
AC
38 ms
10220 KiB
sub3_08.txt
AC
78 ms
16736 KiB
sub3_09.txt
AC
77 ms
16168 KiB
sub3_10.txt
AC
75 ms
12860 KiB
sub4_01.txt
AC
2 ms
3892 KiB
sub4_02.txt
AC
2 ms
3936 KiB
sub4_03.txt
AC
2 ms
4000 KiB
sub4_04.txt
AC
3 ms
4088 KiB
sub4_05.txt
AC
4 ms
4140 KiB
sub4_06.txt
AC
4 ms
3964 KiB
sub4_07.txt
AC
2 ms
3832 KiB
sub5_01.txt
AC
51 ms
11768 KiB
sub5_02.txt
AC
57 ms
15056 KiB
sub5_03.txt
AC
52 ms
13964 KiB
sub5_04.txt
AC
50 ms
11812 KiB
sub5_05.txt
AC
49 ms
14032 KiB
sub5_06.txt
AC
45 ms
11704 KiB
sub5_07.txt
AC
50 ms
11852 KiB
sub5_08.txt
AC
63 ms
14708 KiB
sub5_09.txt
AC
57 ms
14164 KiB
sub5_10.txt
AC
51 ms
11804 KiB
sub5_11.txt
AC
53 ms
10912 KiB
sub5_12.txt
AC
42 ms
8944 KiB
sub5_13.txt
AC
44 ms
10844 KiB
sub5_14.txt
AC
256 ms
27608 KiB
sub5_15.txt
AC
334 ms
27676 KiB
sub5_16.txt
AC
259 ms
27572 KiB
sub5_17.txt
AC
332 ms
27412 KiB
sub5_18.txt
AC
263 ms
27480 KiB
sub5_19.txt
AC
329 ms
27476 KiB
sub5_20.txt
AC
257 ms
27804 KiB
sub5_21.txt
AC
346 ms
27476 KiB
sub5_22.txt
AC
319 ms
20624 KiB