— Dark mode

Datatähti Open 2019

Binary tree

  • Start: N/A
  • End: N/A
CSES - Datatähti Open 2019 - Results
Submission details
Task:Binary tree
Sender:egor.lifar
Submission time:2019-01-20 16:49:01 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.02 s1details
#20.01 s1details
#30.03 s1details
#40.02 s1details
#50.02 s1details
#60.03 s1details
#70.02 s1details
#80.03 s1details
#90.03 s1details
#100.03 s1details
#110.04 s1details
#120.04 s1details
#130.03 s1details
#140.03 s1details
#150.05 s1details
#160.06 s1details
#170.04 s1details
#180.04 s1details
#190.04 s1details
#200.03 s1details
#210.03 s1details
#220.03 s1details
#230.02 s1details
#240.01 s1details
#250.03 s1details
#260.01 s1details
#270.01 s1details
#280.01 s1details
#290.01 s1details
#300.01 s1details
#310.03 s1details
#320.03 s1details
#330.03 s1details
#340.02 s1details
#350.01 s1details
#360.02 s2details
#370.01 s2details
#380.02 s2details
#390.01 s2details
#400.02 s2details
#410.02 s2details
#420.02 s2details
#430.02 s2details
#440.01 s2details
#450.03 s2details
#460.01 s3details
#470.02 s3details
#480.02 s3details
#490.02 s3details
#500.01 s3details
#510.02 s3details
#520.02 s3details
#530.02 s3details
#540.02 s3details
#55--3details
#560.01 s3details
#570.03 s3details
#58--3details
#59--3details
#600.03 s3details
#610.02 s3details
#62--3details
#630.03 s3details
#64--3details
#65--3details
#660.02 s3details
#670.02 s3details
#680.02 s3details
#690.02 s3details
#700.02 s3details
#710.02 s3details
#720.01 s3details
#730.03 s3details
#740.03 s3details
#750.02 s3details
#760.02 s3details
#770.03 s3details

Code

/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <array>
       
        
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define rank rank228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
const string FILENAME = "input";
const int MAXN = 1005;
const double Pi = acos(-1);


struct point
{
    double x, y;
    point(){}
    point(double _x, double _y){ 
        x = _x;
        y = _y;
    }
};



point operator +(const point &a, const point &b) {
    return point(a.x + b.x, a.y + b.y);
}




point operator -(const point &a, const point &b) {
    return point(a.x - b.x, a.y - b.y);
}



int n;
point p[MAXN];
point q[MAXN];


bool rotate(double angle) {
    for (int i = 1; i < n; i++) {
        double x = p[i].x * cos(angle) - p[i].y * sin(angle);
        double y = p[i].y * sin(angle) + p[i].y * cos(angle);
        q[i] = point(x, y);
    }
    bool bad = false;
    for (int i = 0; i < n - 1; i++) {
        if (q[i].x >= q[i + 1].x) {
            bad = true;
        }
    }
    if (!bad) {
        return true;
    }
    for (int i = 0; i < n - 1; i++) {
        if (q[i].x <= q[i + 1].x) {
            bad = true;
        }
    }
    if (!bad) {
        return true;
    }
    return false;
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //read(FILENAME);
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        cin >> n;
        for (int i = 0; i < n; i++) {
            cin >> p[i].x >> p[i].y;
        }
        for (int i = 1; i < n; i++) {
            p[i] = p[i] - p[0];
        }
        p[0] = p[0] - p[0];
        double f = 2.0 * Pi;
        bool ok = false;
        for (int it = 0; it < 20000; it++) {
            if (rotate((f / 20000) * it)) {
                ok = true;
                break;
            }
        }
        if (ok) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    }
    return 0;       
}

Test details

Test 1

Group: 1

Verdict:

input
4 3
10
5
13
view save

correct output
12
view save

user output
YES
YES
YES
YES
view save

Test 2

Group: 1

Verdict:

input
2 0
view save

correct output
2
view save

user output
YES
YES
view save

Test 3

Group: 1

Verdict:

input
2 1
2
view save

correct output
0
view save

user output
YES
YES
view save

Test 4

Group: 1

Verdict:

input
2 1
3
view save

correct output
0
view save

user output
YES
YES
view save

Test 5

Group: 1

Verdict:

input
2 2
2
3
view save

correct output
0
view save

user output
YES
YES
view save

Test 6

Group: 1

Verdict:

input
6 0
view save

correct output
512
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 7

Group: 1

Verdict:

input
6 1
29
view save

correct output
448
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 8

Group: 1

Verdict:

input
6 1
63
view save

correct output
480
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 9

Group: 1

Verdict:

input
6 10
50
63
56
5
...
view save

correct output
132
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 10

Group: 1

Verdict:

input
6 10
25
57
62
42
...
view save

correct output
162
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 11

Group: 1

Verdict:

input
6 10
14
26
34
42
...
view save

correct output
126
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 12

Group: 1

Verdict:

input
6 10
21
60
23
59
...
view save

correct output
128
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 13

Group: 1

Verdict:

input
6 10
8
30
32
16
...
view save

correct output
0
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 14

Group: 1

Verdict:

input
6 20
46
39
55
24
...
view save

correct output
48
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 15

Group: 1

Verdict:

input
6 25
36
23
27
33
...
view save

correct output
4
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 16

Group: 1

Verdict:

input
6 62
42
11
4
61
...
view save

correct output
0
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 17

Group: 1

Verdict:

input
6 32
62
38
57
35
...
view save

correct output
0
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 18

Group: 1

Verdict:

input
6 21
38
51
47
35
...
view save

correct output
60
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 19

Group: 1

Verdict:

input
6 31
59
15
3
26
...
view save

correct output
0
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 20

Group: 1

Verdict:

input
6 14
13
53
55
26
...
view save

correct output
256
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 21

Group: 1

Verdict:

input
5 10
5
17
21
7
...
view save

correct output
6
view save

user output
NO
NO
NO
NO
NO
view save

Test 22

Group: 1

Verdict:

input
6 5
38
18
31
44
...
view save

correct output
312
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 23

Group: 1

Verdict:

input
3 0
view save

correct output
8
view save

user output
YES
YES
YES
view save

Test 24

Group: 1

Verdict:

input
3 1
2
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 25

Group: 1

Verdict:

input
3 1
3
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 26

Group: 1

Verdict:

input
3 2
4
6
view save

correct output
2
view save

user output
YES
YES
YES
view save

Test 27

Group: 1

Verdict:

input
3 2
4
7
view save

correct output
2
view save

user output
YES
YES
YES
view save

Test 28

Group: 1

Verdict:

input
3 2
5
6
view save

correct output
2
view save

user output
YES
YES
YES
view save

Test 29

Group: 1

Verdict:

input
3 2
5
7
view save

correct output
2
view save

user output
YES
YES
YES
view save

Test 30

Group: 1

Verdict:

input
3 2
3
6
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 31

Group: 1

Verdict:

input
3 3
4
5
6
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 32

Group: 1

Verdict:

input
3 3
4
6
7
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 33

Group: 1

Verdict:

input
3 4
4
5
6
7
view save

correct output
0
view save

user output
NO
NO
NO
view save

Test 34

Group: 1

Verdict:

input
5 0
view save

correct output
128
view save

user output
YES
YES
YES
YES
YES
view save

Test 35

Group: 1

Verdict:

input
5 1
14
view save

correct output
96
view save

user output
YES
YES
YES
YES
YES
view save

Test 36

Group: 2

Verdict:

input
2 0
view save

correct output
2
view save

user output
YES
YES
view save

Test 37

Group: 2

Verdict:

input
3 0
view save

correct output
8
view save

user output
YES
YES
YES
view save

Test 38

Group: 2

Verdict:

input
4 0
view save

correct output
32
view save

user output
YES
YES
YES
YES
view save

Test 39

Group: 2

Verdict:

input
23 0
view save

correct output
92960636
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 40

Group: 2

Verdict:

input
36 0
view save

correct output
635008130
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 41

Group: 2

Verdict:

input
42 0
view save

correct output
993282280
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 42

Group: 2

Verdict:

input
57 0
view save

correct output
608377687
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 43

Group: 2

Verdict:

input
58 0
view save

correct output
433510734
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 44

Group: 2

Verdict:

input
59 0
view save

correct output
734042929
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 45

Group: 2

Verdict:

input
60 0
view save

correct output
936171702
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 46

Group: 3

Verdict:

input
2 0
view save

correct output
2
view save

user output
YES
YES
view save

Test 47

Group: 3

Verdict:

input
2 1
2
view save

correct output
0
view save

user output
YES
YES
view save

Test 48

Group: 3

Verdict:

input
2 1
3
view save

correct output
0
view save

user output
YES
YES
view save

Test 49

Group: 3

Verdict:

input
2 2
2
3
view save

correct output
0
view save

user output
YES
YES
view save

Test 50

Group: 3

Verdict:

input
59 0
view save

correct output
734042929
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 51

Group: 3

Verdict:

input
60 0
view save

correct output
936171702
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 52

Group: 3

Verdict:

input
60 1
2
view save

correct output
0
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 53

Group: 3

Verdict:

input
60 1
576460752303423487
view save

correct output
399775198
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 54

Group: 3

Verdict:

input
60 1
1152921504606846975
view save

correct output
667973450
view save

user output
YES
YES
YES
YES
YES
...
Truncated

Test 55

Group: 3

Verdict:

input
60 100000
793144025126277478
493960657696318193
320344157019848454
997683950258055349
...
view save

correct output
12813436
view save

user output
(empty)

Test 56

Group: 3

Verdict:

input
60 100000
986789393060040220
494066507202684187
290830182157570659
210871095549437400
...
view save

correct output
95910570
view save

user output
(empty)

Test 57

Group: 3

Verdict:

input
60 100000
562299894758506682
731132428235172865
481500339045425690
208947005967360560
...
view save

correct output
331624281
view save

user output
(empty)

Test 58

Group: 3

Verdict:

input
60 100000
257846911019866261
803021202233459674
658685893766403373
874237705485665885
...
view save

correct output
880725152
view save

user output
(empty)

Test 59

Group: 3

Verdict:

input
60 100000
681388061028265547
990382999862855868
290694941402209648
491574111397234946
...
view save

correct output
768320742
view save

user output
(empty)

Test 60

Group: 3

Verdict:

input
60 100000
816968727394104576
879176301780517486
1075817811951859004
632046213104404023
...
view save

correct output
111155168
view save

user output
(empty)

Test 61

Group: 3

Verdict:

input
60 100000
406817930303406656
101704482575856800
406817930303412346
813635860606874021
...
view save

correct output
295651662
view save

user output
(empty)

Test 62

Group: 3

Verdict:

input
59 100000
234885934259928845
244746379456935555
40048493361902167
530369614866009610
...
view save

correct output
78892926
view save

user output
(empty)

Test 63

Group: 3

Verdict:

input
16 65534
26355
15205
3420
22822
...
view save

correct output
0
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 64

Group: 3

Verdict:

input
60 99999
1030879879260090869
925369330408563145
403438777989811739
321883235203598800
...
view save

correct output
596899803
view save

user output
(empty)

Test 65

Group: 3

Verdict:

input
60 100000
418885324976523921
418885324976523063
837770649953084829
104721331244134167
...
view save

correct output
0
view save

user output
(empty)

Test 66

Group: 3

Verdict:

input
43 100000
5497882741157
4163319796881
3705445016042
8647080351851
...
view save

correct output
317037701
view save

user output
(empty)

Test 67

Group: 3

Verdict:

input
3 0
view save

correct output
8
view save

user output
YES
YES
YES
view save

Test 68

Group: 3

Verdict:

input
3 1
2
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 69

Group: 3

Verdict:

input
3 1
3
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 70

Group: 3

Verdict:

input
3 2
4
6
view save

correct output
2
view save

user output
YES
YES
YES
view save

Test 71

Group: 3

Verdict:

input
3 2
4
7
view save

correct output
2
view save

user output
YES
YES
YES
view save

Test 72

Group: 3

Verdict:

input
3 2
5
6
view save

correct output
2
view save

user output
YES
YES
YES
view save

Test 73

Group: 3

Verdict:

input
3 2
5
7
view save

correct output
2
view save

user output
YES
YES
YES
view save

Test 74

Group: 3

Verdict:

input
3 2
3
6
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 75

Group: 3

Verdict:

input
3 3
4
5
6
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 76

Group: 3

Verdict:

input
3 3
4
6
7
view save

correct output
0
view save

user output
YES
YES
YES
view save

Test 77

Group: 3

Verdict:

input
3 4
4
5
6
7
view save

correct output
0
view save

user output
NO
NO
NO
view save

Tasks

A Sum-B Bit string-C Sunset-D Binary tree-E Function-F Robot-G Classifier-

Submissions (egor.lifar)

3:46:04 03:45:41 03:45:26 03:45:05 01:36:09 1001:34:13 491:32:14 491:28:27 491:27:31 491:19:56 491:19:28 491:18:48 261:17:46 49