CSES - NOI 2019 Open

CSES - NOI 2019 Open - Results

Submission details
Task:	Distance Code
Sender:	rkocharyan
Submission time:	2019-03-10 14:30:12 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2, 3	details
#2	WRONG ANSWER	0.01 s	1, 2, 3	details
#3	WRONG ANSWER	0.01 s	1, 2, 3	details
#4	WRONG ANSWER	0.02 s	1, 2, 3	details
#5	WRONG ANSWER	0.02 s	1, 2, 3	details
#6	WRONG ANSWER	0.03 s	1, 2, 3	details
#7	WRONG ANSWER	0.02 s	1, 2, 3	details
#8	WRONG ANSWER	0.02 s	1, 2, 3	details
#9	WRONG ANSWER	0.03 s	1, 2, 3	details
#10	WRONG ANSWER	0.02 s	1, 2, 3	details
#11	WRONG ANSWER	0.03 s	1, 2, 3	details
#12	RUNTIME ERROR	0.02 s	2, 3	details
#13	RUNTIME ERROR	0.02 s	2, 3	details
#14	RUNTIME ERROR	0.01 s	2, 3	details
#15	RUNTIME ERROR	0.01 s	2, 3	details
#16	RUNTIME ERROR	0.02 s	3	details
#17	RUNTIME ERROR	0.01 s	3	details
#18	RUNTIME ERROR	0.01 s	3	details
#19	RUNTIME ERROR	0.02 s	3	details
#20	WRONG ANSWER	0.03 s	1, 2, 3	details

Compiler report

input/code.cpp: In function 'std::__cxx11::string to_string(std::__cxx11::string, int, int)':
input/code.cpp:9:202: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(bool b) { return (b ? "true" : "false"); } string to_string(char c){ return string({c}); } template<size_t N> string to_string(bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; templat...

Code

#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbgs(...) {string foo = to_string(__VA_ARGS__); cout << foo.substr(foo[0] == n_l) << (foo.back() == n_l ? "" : " ");}
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
/*compact version*/
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(bool b) { return (b ? "true" : "false"); } string to_string(char c){ return string({c}); } template<size_t N> string to_string(bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; }
/*end of compact version*/

const int N = 17;

vector <int> g[N];
int p[N];

void prec(int v, int d) {
    p[v] = d;
    for (int u : g[v]) {
        if (u == d) continue;
        prec(u, v);
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    if (t == 1) {
        int n;
        cin >> n;
        for (int i = 0; i < n - 1; i++) {
            int u, v;
            cin >> u >> v;
            g[u].push_back(v);
            g[v].push_back(u);
        }
        prec(1, 0);
        vector <int> kek;
        vector <int> deg(n + 1, 0);
        for (int i = 1; i <= n; i++) {
            deg[i] = (int) g[i].size();
            if (deg[i] == 1) {
                kek.push_back(i);
            }
        }
        for (int i = 0; i < n; i++) {
            int x = kek.back();
            cout << x << ' ';
            deg[p[x]]--;
            kek.pop_back();
            if (deg[p[x]] == 1) {
                kek.push_back(p[x]);
            }
        }
        cout << '\n';
        return 0;
    }
    return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 2 2 1` view save

correct output
(empty)

user output
(empty)

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 3 3 1 2 1` view save

correct output
(empty)

user output
(empty)

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 4 3 2 2 1 4 1` view save

correct output
(empty)

user output
(empty)

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 4 2 3 3 4 1 3` view save

correct output
(empty)

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 5 3 5 4 1 1 3 ...` view save

correct output
(empty)

user output
(empty)

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 5 3 2 3 4 5 1 ...` view save

correct output
(empty)

user output
(empty)

Test 7

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 5 4 3 1 4 4 2 ...` view save

correct output
(empty)

user output
(empty)

Test 8

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 9 3 8 9 2 9 ...` view save

correct output
(empty)

user output
(empty)

Test 9

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 9 2 5 8 7 1 ...` view save

correct output
(empty)

user output
(empty)

Test 10

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 10 4 9 1 4 7 ...` view save

correct output
(empty)

user output
(empty)

Test 11

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 2 6 4 3 3 5 ...` view save

correct output
(empty)

user output
(empty)

Test 12

Group: 2, 3

Verdict: RUNTIME ERROR

input
`1 500 10 6 6 255 6 428 ...` view save

correct output
(empty)

user output
(empty)

Test 13

Group: 2, 3

Verdict: RUNTIME ERROR

input
`1 500 152 466 451 313 158 479 ...` view save

correct output
(empty)

user output
(empty)

Test 14

Group: 2, 3

Verdict: RUNTIME ERROR

input
`1 500 109 440 330 190 443 161 ...` view save

correct output
(empty)

user output
(empty)

Test 15

Group: 2, 3

Verdict: RUNTIME ERROR

input
`1 500 144 373 257 233 341 318 ...` view save

correct output
(empty)

user output
(empty)

Test 16

Group: 3

Verdict: RUNTIME ERROR

input
`1 100000 54983 75172 93807 75172 44082 75172 ...` view save

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict: RUNTIME ERROR

input
`1 100000 88863 19059 86423 76688 98536 95984 ...` view save

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: RUNTIME ERROR

input
`1 100000 59979 6389 19097 24999 27846 82330 ...` view save

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict: RUNTIME ERROR

input
`1 100000 58761 66001 25102 51081 98625 67861 ...` view save

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 6 2 1 3 2 4 2 ...` view save

correct output
(empty)

user output
(empty)

NOI 2019 Open

Distance Code

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (rkocharyan)