— Dark mode

BOI 2026 Mirror Day 2

Distances

  • Start: 2026-04-17 10:00:00
  • End: 2026-04-17 15:00:00
Submission details
Task:Distances
Sender:Daniel_1997
Submission time:2026-04-17 11:09:00 +0300
Language:C++ (C++17)
Status:READY
Result:6
Feedback
subtaskverdictscore
#10
#20
#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
#60.00 s1, 4, 6details
#7ACCEPTED0.00 s1, 4, 6details
#80.00 s1, 2, 4, 6details
#9ACCEPTED0.00 s1, 3, 4, 5, 6details
#100.00 s1, 4, 5, 6details
#110.00 s1, 4, 6details
#12ACCEPTED0.00 s1, 4, 6details
#130.00 s1, 4, 6details
#140.00 s1, 6details
#150.00 s1, 2, 6details
#160.00 s4, 6details
#170.00 s4, 6details
#18ACCEPTED0.01 s3, 4, 5, 6details
#190.00 s4, 5, 6details
#200.00 s4, 5, 6details
#210.00 s5, 6details
#220.00 s5, 6details
#230.00 s2, 6details
#24ACCEPTED0.01 s3, 4, 5, 6details
#250.00 s4, 5, 6details
#260.00 s4, 5, 6details
#270.00 s5, 6details
#280.00 s5, 6details
#290.00 s2, 6details
#30ACCEPTED0.01 s3, 4, 5, 6details
#310.00 s4, 5, 6details
#320.00 s4, 5, 6details
#330.00 s4, 5, 6details
#340.00 s5, 6details
#350.00 s5, 6details
#360.00 s5, 6details
#370.00 s6details
#380.00 s6details
#390.00 s2, 6details
#400.00 s6details
#410.00 s6details
#420.00 s6details
#430.00 s6details
#440.00 s6details

Compiler report

input/code.cpp: In function 'void solve()':
input/code.cpp:84:44: 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]
   84 |                         for(int i1 = 0; i1 < aux.size(); i1++)
      |                                         ~~~^~~~~~~~~~~~
input/code.cpp:137:48: 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]
  137 |                             for(int i1 = 0; i1 < aux.size(); i1++)
      |                                             ~~~^~~~~~~~~~~~
input/code.cpp:46:9: warning: unused variable 'ans' [-Wunused-variable]
   46 |     int ans = 0;
      |         ^~~
input/code.cpp: In function 'int32_t main()':
input/code.cpp:224:9: warning: unused variable 't' [-Wunused-variable]
  2...

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);
}

int n,k;

void solve() {
    
    
    if(n == 1)
    {
        cout << 1 << " " << 1 << endl;
        return;
    }

    vector<bool> square(1000001, 0);
 
    for(int i = 1; i <= 1000; i++)
    {
        square[i * i] = 1;
    }

    vector<pair<int,int> > v(n + 1, {1,1});


    int ans = 0;

    if(n == 2)
    {
        for(int i = 1; ; i++)
        {
            for(int j = 1; j <= i; j++)
            {
                int diff = dist(v[1].fr, v[1].sc, i, j);
                int cont = square[diff];
                if(cont == k && diff)
                {
                    cout << 1 << " " << 1 << endl;
                    cout << i << " " << j << endl;
                    return;
                }
            }
        }
    }

    if(n == 3)
    {
        for(int i = 1; ; i++)
        {
            bool f = 0;
            for(int j = 1; j <= i; j++)
            {
                for(int k = 1; k <= i; k++)
                {
                    for(int l = 1; l <= k; l++)
                    {
                        vector<pair<int,int> >aux;
                        aux.pb({1,1});
                        aux.pb({i,j});
                        aux.pb({k,l});

                        int cont = 0;

                        for(int i1 = 0; i1 < aux.size(); i1++)
                        {
                            auto[x1, y1] = aux[i1];
                            for(int i2 = 0; i2 < i1; i2++)
                            {
                                auto[x2, y2] = aux[i2];
                                int diff = dist(x1, y1, x2, y2);
                                if(diff == 0)
                                {
                                    f = 1;
                                    break;
                                }
                                cont += square[diff];
                            }
                        }

                        if(cont == k && !f)
                        {
                            for(auto oo : aux)
                            {
                                cout << oo.fr << " " << oo.sc << endl;
                            }
                            return;
                        }
                        f = 0;
                        
                    }
                }
            }
        }
    }

    for(int i = 1; ; i++)
    {
        bool f = 0;
        for(int j = 1; j <= i; j++)
        {
            for(int k = 1; k <= i; k++)
            {
                for(int l = 1; l <= k; l++)
                {
                    for(int p1 = 1; p1 <= j; p1++)
                    {
                        for(int p2 = 1; p2 <= p1; p2++)
                        {
                            vector<pair<int,int> >aux;
                            aux.pb({1,1});
                            aux.pb({i,j});
                            aux.pb({k,l});
                            aux.pb({p1,p2});
        
                            int cont = 0;
        
                            for(int i1 = 0; i1 < aux.size(); i1++)
                            {
                                auto[x1, y1] = aux[i1];
                                for(int i2 = 0; i2 < i1; i2++)
                                {
                                    auto[x2, y2] = aux[i2];
                                    int diff = dist(x1, y1, x2, y2);
                                    if(diff == 0)
                                    {
                                        f = 1;
                                        break;
                                    }
                                    cont += square[diff];
                                }
                            }
        
                            if(cont == k && !f)
                            {
                                for(auto oo : aux)
                                {
                                    cout << oo.fr << " " << oo.sc << endl;
                                }
                                return;
                            }
                            f = 0;
                        }
                    }
                    
                }
            }
        }
    }
    
}

void solve2() {

    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});
 
    for(int i = 2; 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;
        }
    }
 
    for(int i = 1; i <= n; i++)
    {
        cout << v[i].fr << " " << v[i].sc << endl;
    }



}
 
int32_t main() {
    ios;
    int t = 1;
    cin >> n >> k;
    if(k)solve();
    else solve2();
}

Test details

Test 1

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
3 2
view save

correct output
1 1
1 2
2 2
view save

user output
1 1
2 1
2 2
view save

Test 2

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

Verdict: ACCEPTED

input
1 0
view save

correct output
1 0
view save

user output
1 1
view save

Test 3

Subtask: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
2 0
view save

correct output
1 0
804289383 846930886
view save

user output
1 1
2 2
view save

Test 4

Subtask: 1, 2, 4, 6

Verdict: ACCEPTED

input
2 1
view save

correct output
1 0
2 0
view save

user output
1 1
2 1
view save

Test 5

Subtask: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
3 0
view save

correct output
1 0
804289383 846930886
681692777 714636915
view save

user output
1 1
2 2
3 3
view save

Test 6

Subtask: 1, 4, 6

Verdict:

input
3 1
view save

correct output
1 0
2 0
804289383 846930886
view save

user output
1 1
2 1
2 2
view save

Test 7

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
3 2
view save

correct output
1 1
1 2
2 2
view save

user output
1 1
2 1
2 2
view save

Test 8

Subtask: 1, 2, 4, 6

Verdict:

input
3 3
view save

correct output
1 0
2 0
3 0
view save

user output
1 1
2 1
2 2
view save

Test 9

Subtask: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
4 0
view save

correct output
1 0
804289383 846930886
681692777 714636915
957747793 424238335
view save

user output
1 1
2 2
3 3
4 4
view save

Test 10

Subtask: 1, 4, 5, 6

Verdict:

input
4 1
view save

correct output
1 0
2 0
804289383 846930886
681692777 714636915
view save

user output
1 1
3 2
3 1
2 2
view save

Test 11

Subtask: 1, 4, 6

Verdict:

input
4 2
view save

correct output
21392 0
1 0
0 510510
804289383 846930886
view save

user output
1 1
3 2
3 1
2 2
view save

Test 12

Subtask: 1, 4, 6

Verdict: ACCEPTED

input
4 3
view save

correct output
1 0
2 0
3 0
804289383 846930886
view save

user output
1 1
3 2
3 1
2 2
view save

Test 13

Subtask: 1, 4, 6

Verdict:

input
4 4
view save

correct output
21392 0
1 0
2 0
0 510510
view save

user output
1 1
3 2
3 1
2 2
view save

Test 14

Subtask: 1, 6

Verdict:

input
4 5
view save

correct output
21392 0
22600 0
1 0
0 510510
view save

user output
1 1
3 2
3 1
2 2
view save

Test 15

Subtask: 1, 2, 6

Verdict:

input
4 6
view save

correct output
1 0
2 0
3 0
4 0
view save

user output
1 1
3 2
3 1
2 2
view save

Test 16

Subtask: 4, 6

Verdict:

input
5 5
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 17

Subtask: 4, 6

Verdict:

input
6 5
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 18

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
98 0
view save

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

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

Test 19

Subtask: 4, 5, 6

Verdict:

input
98 97
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 20

Subtask: 4, 5, 6

Verdict:

input
98 98
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 21

Subtask: 5, 6

Verdict:

input
98 1185
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 22

Subtask: 5, 6

Verdict:

input
98 1188
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 23

Subtask: 2, 6

Verdict:

input
98 4753
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 24

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
99 0
view save

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

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

Test 25

Subtask: 4, 5, 6

Verdict:

input
99 98
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 26

Subtask: 4, 5, 6

Verdict:

input
99 99
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 27

Subtask: 5, 6

Verdict:

input
99 1201
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 28

Subtask: 5, 6

Verdict:

input
99 1212
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 29

Subtask: 2, 6

Verdict:

input
99 4851
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 30

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
100 0
view save

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

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

Test 31

Subtask: 4, 5, 6

Verdict:

input
100 1
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 32

Subtask: 4, 5, 6

Verdict:

input
100 5
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 33

Subtask: 4, 5, 6

Verdict:

input
100 100
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 34

Subtask: 5, 6

Verdict:

input
100 1000
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 35

Subtask: 5, 6

Verdict:

input
100 1232
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 36

Subtask: 5, 6

Verdict:

input
100 1237
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 37

Subtask: 6

Verdict:

input
100 2222
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 38

Subtask: 6

Verdict:

input
100 3395
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 39

Subtask: 2, 6

Verdict:

input
100 4950
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 40

Subtask: 6

Verdict:

input
100 4949
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 41

Subtask: 6

Verdict:

input
100 4948
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 42

Subtask: 6

Verdict:

input
100 4930
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 43

Subtask: 6

Verdict:

input
100 4920
view save

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

user output
1 1
3 2
3 1
2 2
view save

Test 44

Subtask: 6

Verdict:

input
100 4900
view save

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

user output
1 1
3 2
3 1
2 2
view save

Tasks

A Distances-B Hamilton-C Sort-

Submissions (Daniel_1997)

2026-04-17 21:22:09 102026-04-17 21:16:29 102026-04-17 14:40:29 102026-04-17 14:37:32 252026-04-17 14:34:50 62026-04-17 14:27:57 102026-04-17 14:24:45 62026-04-17 14:20:03 42026-04-17 14:19:15 102026-04-17 12:43:28 102026-04-17 12:42:00 102026-04-17 12:41:33 102026-04-17 12:36:14 62026-04-17 12:35:40 62026-04-17 12:33:58 212026-04-17 12:25:35 102026-04-17 12:10:30 102026-04-17 12:00:25 102026-04-17 11:56:35 252026-04-17 11:46:05 62026-04-17 11:41:45 62026-04-17 11:39:31 62026-04-17 11:37:45 62026-04-17 11:34:43 62026-04-17 11:16:12 172026-04-17 11:09:00 62026-04-17 10:39:48 42026-04-17 10:37:47 02026-04-17 10:36:39 62026-04-17 10:31:12 0