Submission details
Task:Distances
Sender:Daniel_1997
Submission time:2026-04-17 12:33:58 +0300
Language:C++ (C++17)
Status:READY
Result:21
Feedback
subtaskverdictscore
#1ACCEPTED11
#2ACCEPTED4
#3ACCEPTED6
#40
#50
#60
Test results
testverdicttimesubtask
#1ACCEPTED0.00 s1, 4, 6details
#2ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#3ACCEPTED0.00 s1, 3, 4, 5, 6details
#4ACCEPTED0.00 s1, 2, 4, 6details
#5ACCEPTED0.00 s1, 3, 4, 5, 6details
#6ACCEPTED0.00 s1, 4, 6details
#7ACCEPTED0.01 s1, 4, 6details
#8ACCEPTED0.00 s1, 2, 4, 6details
#9ACCEPTED0.00 s1, 3, 4, 5, 6details
#10ACCEPTED0.00 s1, 4, 5, 6details
#11ACCEPTED0.00 s1, 4, 6details
#12ACCEPTED0.00 s1, 4, 6details
#13ACCEPTED0.00 s1, 4, 6details
#14ACCEPTED0.00 s1, 6details
#15ACCEPTED0.00 s1, 2, 6details
#16ACCEPTED0.00 s4, 6details
#17ACCEPTED0.00 s4, 6details
#18ACCEPTED0.01 s3, 4, 5, 6details
#190.15 s4, 5, 6details
#200.20 s4, 5, 6details
#210.73 s5, 6details
#221.21 s5, 6details
#23ACCEPTED0.93 s2, 6details
#24ACCEPTED0.01 s3, 4, 5, 6details
#250.20 s4, 5, 6details
#260.26 s4, 5, 6details
#27--5, 6details
#28--5, 6details
#29ACCEPTED0.96 s2, 6details
#30ACCEPTED0.01 s3, 4, 5, 6details
#31ACCEPTED0.01 s4, 5, 6details
#32ACCEPTED0.01 s4, 5, 6details
#330.31 s4, 5, 6details
#340.81 s5, 6details
#35ACCEPTED0.13 s5, 6details
#361.24 s5, 6details
#371.12 s6details
#38--6details
#39ACCEPTED0.99 s2, 6details
#401.27 s6details
#411.27 s6details
#421.27 s6details
#431.27 s6details
#441.27 s6details

Code

#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define int long long
#define all(x) x.begin(), x.end()
#define ios ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0)
 
const int oo = 1e18;
const int mod = 1e8 + 7;
const int my[8]={0, 0, 1, -1, 1, 1, -1, -1};
const int mx[8]={1, -1, 0, 0, 1, -1, -1, 1};
 
int pw(int x)
{
    return x * x;
} 
 
int dist(int x1, int y1, int x2, int y2)
{
    return pw(x1 - x2) + pw(y1 - y2);
}
 
void solve() {
    int n,k;
    cin >> n >> k;
 
    vector<bool> square(1000001, 0);
 
    for(int i = 0; i <= 1000; i++)
    {
        square[i * i] = 1;
    }
 
    vector<pair<int,int> > v(n + 1, {1,1});
 
    
 
    int ans = 0;
 
    int pp = 0;
    
    for(int i = 2; i <= n; i++)
    {
        if(k == 0)break;
        bool f2 = 0;
        for(int x = -500; x <= 500; x++)
        {
            bool f = 0;
            for(int y = -500; y <= 500; y++)
            {
 
                int cont = 0;
 
                for(int l = 1; l < i; l++)
                {
                    auto[x2, y2] = v[l];
                    int diff = dist(x, y, x2, y2);
                    if(diff == 0)
                    {
                        f = 1;
                        break;
                    }
                    
                    cont += square[diff];
                }
 
                int diff = min(i - 1,k - ans);
                if(cont != diff)continue;
 
                if(!f && ans + cont <= k && cont != 0)
                {
                    v[i] = {x, y};
                    //cerr << x << " " << y << endl;
                    //cerr << cont << endl;
                    ans += cont;
                    f2 = 1;
                    break;
                }
                f = 0;
            }
            if(f2)break;
        }
        if(ans == k)
        {
            pp = i;
            break;
        }
    }
 
    for(int i = pp + 1; i <= n; i++)
    {
        bool f = 0;
        for(int j = 1; ; j++)
        {
            for(int k = 1; k <= j;k++)
            {
                int x1 = j, y1 = k;
                f = 0;
                for(int l = 1; l < i; l++)
                {
                    auto[x2, y2] = v[l];
                    int diff = pw(x1 - x2) + pw(y1 - y2);
                    if(square[diff])
                    {
                        f = 1;
                        break;
                    }
                    
                }
                if(!f)
                {
                    v[i] = {x1, y1};
                    break;
                }
            }
            if(!f)break;
        }
    }
 
    //cout << n << endl;
    for(int i = 1; i <= n; i++)
    {
        cout << v[i].fr << " " << v[i].sc << endl;
    }
}
 
int32_t main() {
    ios;
    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
-500 1
-500 -500

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
-500 1

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
-500 1
2 2

Test 7

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
3 2

correct output
1 1
1 2
2 2

user output
1 1
-500 1
-500 -500

Test 8

Subtask: 1, 2, 4, 6

Verdict: ACCEPTED

input
3 3

correct output
1 0
2 0
3 0

user output
1 1
-500 1
-499 1

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
-500 1
2 2
3 3

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
-500 1
-500 -500
2 2

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
-500 1
-499 1
2 2

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
-500 1
-499 1
-500 -500

Test 14

Subtask: 1, 6

Verdict: ACCEPTED

input
4 5

correct output
21392 0
22600 0
1 0
0 510510

user output
1 1
-500 1
-499 1
-499 -374

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
-500 1
-499 1
-498 1

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
-500 1
-499 1
-499 -374
2 2

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
-500 1
-499 1
-499 -374
2 2
...

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
1 1
-500 1
-499 1
-498 1
-497 1
...

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
-500 1
-499 1
-498 1
-497 1
...

Test 21

Subtask: 5, 6

Verdict:

input
98 1185

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

user output
1 1
-500 1
-499 1
-498 1
-497 1
...

Test 22

Subtask: 5, 6

Verdict:

input
98 1188

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

user output
1 1
-500 1
-499 1
-498 1
-497 1
...

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
-500 1
-499 1
-498 1
-497 1
...

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
1 1
-500 1
-499 1
-498 1
-497 1
...

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
-500 1
-499 1
-498 1
-497 1
...

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
-500 1
-499 1
-498 1
-497 1
...

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
-500 1
2 2
3 3
4 4
...

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
-500 1
-499 1
-499 -374
2 2
...

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
-500 1
-499 1
-498 1
-497 1
...

Test 34

Subtask: 5, 6

Verdict:

input
100 1000

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

user output
1 1
-500 1
-499 1
-498 1
-497 1
...

Test 35

Subtask: 5, 6

Verdict: ACCEPTED

input
100 1232

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

user output
1 1
-500 1
-499 1
-498 1
-497 1
...

Test 36

Subtask: 5, 6

Verdict:

input
100 1237

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

user output
1 1
-500 1
-499 1
-498 1
-497 1
...

Test 37

Subtask: 6

Verdict:

input
100 2222

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

user output
1 1
-500 1
-499 1
-498 1
-497 1
...

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
-500 1
-499 1
-498 1
-497 1
...

Test 40

Subtask: 6

Verdict:

input
100 4949

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

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

Test 41

Subtask: 6

Verdict:

input
100 4948

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

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

Test 42

Subtask: 6

Verdict:

input
100 4930

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

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

Test 43

Subtask: 6

Verdict:

input
100 4920

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

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

Test 44

Subtask: 6

Verdict:

input
100 4900

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

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