Submission details
Task:Distances
Sender:Diego_09
Submission time:2026-04-17 13:14:35 +0300
Language:C++ (C++17)
Status:READY
Result:21
Feedback
subtaskverdictscore
#1ACCEPTED11
#2ACCEPTED4
#3ACCEPTED6
#40
#50
#60
Test results
testverdicttimesubtask
#1ACCEPTED0.49 s1, 4, 6details
#2ACCEPTED0.40 s1, 2, 3, 4, 5, 6details
#3ACCEPTED0.40 s1, 3, 4, 5, 6details
#4ACCEPTED0.40 s1, 2, 4, 6details
#5ACCEPTED0.39 s1, 3, 4, 5, 6details
#6ACCEPTED0.39 s1, 4, 6details
#7ACCEPTED0.40 s1, 4, 6details
#8ACCEPTED0.53 s1, 2, 4, 6details
#9ACCEPTED0.39 s1, 3, 4, 5, 6details
#10ACCEPTED0.41 s1, 4, 5, 6details
#11ACCEPTED0.39 s1, 4, 6details
#12ACCEPTED0.39 s1, 4, 6details
#13ACCEPTED0.50 s1, 4, 6details
#14ACCEPTED0.39 s1, 6details
#15ACCEPTED0.39 s1, 2, 6details
#16ACCEPTED0.40 s4, 6details
#17ACCEPTED0.39 s4, 6details
#18ACCEPTED0.39 s3, 4, 5, 6details
#190.40 s4, 5, 6details
#200.40 s4, 5, 6details
#210.40 s5, 6details
#220.39 s5, 6details
#23ACCEPTED0.40 s2, 6details
#24ACCEPTED0.40 s3, 4, 5, 6details
#250.40 s4, 5, 6details
#260.40 s4, 5, 6details
#270.40 s5, 6details
#280.40 s5, 6details
#29ACCEPTED0.39 s2, 6details
#30ACCEPTED0.39 s3, 4, 5, 6details
#31ACCEPTED0.40 s4, 5, 6details
#32ACCEPTED0.40 s4, 5, 6details
#330.51 s4, 5, 6details
#340.40 s5, 6details
#350.40 s5, 6details
#360.40 s5, 6details
#370.39 s6details
#380.40 s6details
#39ACCEPTED0.41 s2, 6details
#400.39 s6details
#410.39 s6details
#420.49 s6details
#430.40 s6details
#440.39 s6details

Compiler report

input/code.cpp: In function 'void solve()':
input/code.cpp:124:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |             for(int i=0;i<p.size();i++){
      |                         ~^~~~~~~~~
input/code.cpp:127:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |                 for(int j=i+1;j<p.size();j++){
      |                               ~^~~~~~~~~

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#if defined(__has_include)&&__has_include("custom_h/debugging.h")
#define local_run 1
#include "custom_h\debugging.h"
#else 
#define local_run 0
#endif
// #pragma GCC target ("avx2");
// #pragma GCC optimize ("Ofast");
#define rall(v) v.rbegin(),v.rend()
#define all(v) v.begin(),v.end()
#define keyval find_by_order
#define valkey order_of_key
#define int long long
#define pb push_back
#define s second
#define f first

using namespace __gnu_pbds; 
using namespace std;
template<typename T>
using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename T>
using omset=tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
    
void set_io(string name=""){
    ios_base::sync_with_stdio(0);cin.tie(0);
    if(name.size() and !local_run){
        // freopen((name+".in").c_str(),"r",stdin);
        // freopen((name+".out").c_str(),"w",stdout);
    }
}

const int my[]={0,0,1,-1,1,1,-1,-1};
const int mx[]={1,-1,0,0,1,-1,-1,1};
const int md=1e9+7;
const int oo=1e18;

map<int,bool>sq;

void solve(){
    int n,k;
    cin>>n>>k;

    for(int i=0;i<=1000000;i++){
        sq[i*i]=1;
    }

    if(k*2==n*(n-1)){
        for(int i=1;i<=n;i++)cout<<"1 "<<i<<"\n";
        return;
    }
    if(k==0){       
        for(int i=1;i<=n;i++)cout<<i<<" "<<i<<"\n";
        return;
    }

    if(n==1){
        cout<<"1 1\n";
        return;
    }if(n==2){
        cout<<"1 1\n2 2\n";
        return;
    }if(n==3){
        if(k==1)cout<<"1 1\n1 2\n2 3\n";
        else cout<<"1 1\n1 2\n2 2\n";
        return;
    }if(n==4){
        if(k==1)cout<<"1 1\n1 2\n2 3\n3 4\n";
        else if(k==2)cout<<"1 1\n1 2\n2 2\n3 3\n";
        else if(k==3)cout<<"1 1\n1 2\n1 3\n2 4\n";
        else if(k==4)cout<<"1 1\n1 2\n1 3\n2 3\n";
        else cout<<"1 1\n1 4\n5 4\n9 7\n";
        return;
    }

    if(k<=n){
        if(k==n){
            vector<pair<int,int>>p={{1,1},{1,2},{1,3}};
            int x=2,y=3;
            for(int i=3;i<k;i++){
                p.pb({x,y});
                if(i%2)y++;
                else x++;
            }
            for(auto cc:p)cout<<cc.f<<" "<<cc.s<<"\n";
        }else{
            vector<pair<int,int>>p;

            int x=0,y=1;
            for(int i=0;i<=k;i++){
                if(i%2)y++;
                else x++;
                p.pb({x,y});
            }         

            x=-100000000;
            y=100000000;

            for(int i=1;i<n-k;i++){
                bool ok=1;

                while(1){
                    x++;
                    y--;

                    ok=1;
                    for(auto cc:p){
                        if(sq[pow(abs(x-cc.f),2)+pow(abs(y-cc.s),2)]==1 or cc.f==x or cc.s==y){
                            ok=0;
                            break;
                        }
                    }

                    if(ok==1)break;
                }

                p.pb({x,y});
            }

            int cont=0;
            for(int i=0;i<p.size();i++){
                int x1=p[i].f;
                int y1=p[i].s;
                for(int j=i+1;j<p.size();j++){
                    int a1=p[j].f;
                    int b1=p[j].s;
                    if(sq[pow(abs(x1-a1),2)+pow(abs(y1-b1),2)]==1 or x1==a1 or y1==b1){
                        cont++;
                    }
                }
            }

            if(cont!=k)exit(-1);
            
            for(auto cc:p)cout<<cc.f<<" "<<cc.s<<"\n";
        }
    }
}

int32_t main(){set_io("");
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
}

Test details

Test 1

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
3 2

correct output
1 1
1 2
2 2

user output
1 1
1 2
2 2

Test 2

Subtask: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
1 0

correct output
1 0

user output
1 1

Test 3

Subtask: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
2 0

correct output
1 0
804289383 846930886

user output
1 1
2 2

Test 4

Subtask: 1, 2, 4, 6

Verdict: ACCEPTED

input
2 1

correct output
1 0
2 0

user output
1 1
1 2

Test 5

Subtask: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
3 0

correct output
1 0
804289383 846930886
681692777 714636915

user output
1 1
2 2
3 3

Test 6

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
3 1

correct output
1 0
2 0
804289383 846930886

user output
1 1
1 2
2 3

Test 7

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
3 2

correct output
1 1
1 2
2 2

user output
1 1
1 2
2 2

Test 8

Subtask: 1, 2, 4, 6

Verdict: ACCEPTED

input
3 3

correct output
1 0
2 0
3 0

user output
1 1
1 2
1 3

Test 9

Subtask: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
4 0

correct output
1 0
804289383 846930886
681692777 714636915
957747793 424238335

user output
1 1
2 2
3 3
4 4

Test 10

Subtask: 1, 4, 5, 6

Verdict: ACCEPTED

input
4 1

correct output
1 0
2 0
804289383 846930886
681692777 714636915

user output
1 1
1 2
2 3
3 4

Test 11

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
4 2

correct output
21392 0
1 0
0 510510
804289383 846930886

user output
1 1
1 2
2 2
3 3

Test 12

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
4 3

correct output
1 0
2 0
3 0
804289383 846930886

user output
1 1
1 2
1 3
2 4

Test 13

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
4 4

correct output
21392 0
1 0
2 0
0 510510

user output
1 1
1 2
1 3
2 3

Test 14

Subtask: 1, 6

Verdict: ACCEPTED

input
4 5

correct output
21392 0
22600 0
1 0
0 510510

user output
1 1
1 4
5 4
9 7

Test 15

Subtask: 1, 2, 6

Verdict: ACCEPTED

input
4 6

correct output
1 0
2 0
3 0
4 0

user output
1 1
1 2
1 3
1 4

Test 16

Subtask: 4, 6

Verdict: ACCEPTED

input
5 5

correct output
21392 0
22600 0
1 0
0 510510
804289383 846930886

user output
1 1
1 2
1 3
2 3
2 4

Test 17

Subtask: 4, 6

Verdict: ACCEPTED

input
6 5

correct output
21392 0
22600 0
1 0
0 510510
804289383 846930886
...

user output
1 1
1 2
2 2
2 3
3 3
...

Test 18

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
98 0

correct output
1 0
804289383 846930886
681692777 714636915
957747793 424238335
719885386 649760492
...

user output
1 1
2 2
3 3
4 4
5 5
...

Test 19

Subtask: 4, 5, 6

Verdict:

input
98 97

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 20

Subtask: 4, 5, 6

Verdict:

input
98 98

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
1 1
1 2
1 3
2 3
2 4
...

Test 21

Subtask: 5, 6

Verdict:

input
98 1185

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 22

Subtask: 5, 6

Verdict:

input
98 1188

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 23

Subtask: 2, 6

Verdict: ACCEPTED

input
98 4753

correct output
1 0
2 0
3 0
4 0
5 0
...

user output
1 1
1 2
1 3
1 4
1 5
...

Test 24

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
99 0

correct output
1 0
804289383 846930886
681692777 714636915
957747793 424238335
719885386 649760492
...

user output
1 1
2 2
3 3
4 4
5 5
...

Test 25

Subtask: 4, 5, 6

Verdict:

input
99 98

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 26

Subtask: 4, 5, 6

Verdict:

input
99 99

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
1 1
1 2
1 3
2 3
2 4
...

Test 27

Subtask: 5, 6

Verdict:

input
99 1201

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 28

Subtask: 5, 6

Verdict:

input
99 1212

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 29

Subtask: 2, 6

Verdict: ACCEPTED

input
99 4851

correct output
1 0
2 0
3 0
4 0
5 0
...

user output
1 1
1 2
1 3
1 4
1 5
...

Test 30

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
100 0

correct output
1 0
804289383 846930886
681692777 714636915
957747793 424238335
719885386 649760492
...

user output
1 1
2 2
3 3
4 4
5 5
...

Test 31

Subtask: 4, 5, 6

Verdict: ACCEPTED

input
100 1

correct output
1 0
2 0
804289383 846930886
681692777 714636915
957747793 424238335
...

user output
1 1
1 2
-99999999 99999999
-99999998 99999998
-99999997 99999997
...

Test 32

Subtask: 4, 5, 6

Verdict: ACCEPTED

input
100 5

correct output
21392 0
22600 0
1 0
0 510510
804289383 846930886
...

user output
1 1
1 2
2 2
2 3
3 3
...

Test 33

Subtask: 4, 5, 6

Verdict:

input
100 100

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
1 1
1 2
1 3
2 3
2 4
...

Test 34

Subtask: 5, 6

Verdict:

input
100 1000

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 35

Subtask: 5, 6

Verdict:

input
100 1232

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 36

Subtask: 5, 6

Verdict:

input
100 1237

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 37

Subtask: 6

Verdict:

input
100 2222

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 38

Subtask: 6

Verdict:

input
100 3395

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 39

Subtask: 2, 6

Verdict: ACCEPTED

input
100 4950

correct output
1 0
2 0
3 0
4 0
5 0
...

user output
1 1
1 2
1 3
1 4
1 5
...

Test 40

Subtask: 6

Verdict:

input
100 4949

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 41

Subtask: 6

Verdict:

input
100 4948

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 42

Subtask: 6

Verdict:

input
100 4930

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 43

Subtask: 6

Verdict:

input
100 4920

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)

Test 44

Subtask: 6

Verdict:

input
100 4900

correct output
21392 0
22600 0
30056 0
34848 0
38584 0
...

user output
(empty)