CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Ivar
Submission time:	2019-03-06 15:48:50 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	TIME LIMIT EXCEEDED	0
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#2	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#3	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#4	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#5	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#6	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#7	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#8	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#9	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#10	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#11	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#12	TIME LIMIT EXCEEDED	--	2, 3	details
#13	TIME LIMIT EXCEEDED	--	2, 3	details
#14	TIME LIMIT EXCEEDED	--	2, 3	details
#15	TIME LIMIT EXCEEDED	--	2, 3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	TIME LIMIT EXCEEDED	--	1, 2, 3	details

Code

using namespace std;
#include <bits/stdc++.h> // Remove first slash when turned in
#define rep(i, a, b) for(int i = a; i < b; i++)
#define sz(v) int(v.size())
#define trav(x, v) for(auto &x : v)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;



int t, n;

vector<set<int>> neighbors;

void genList() {
    set<tuple<int, int>> close;
    set<tuple<int, int>> indicies;

    rep(i, 0, n) {
        close.insert(
            {sz(neighbors[i]), i} );
        indicies.insert(
            {i, sz(neighbors[i])}
        );
    }
    int index; int _;
    rep(i, 0, n) {
        auto elem = close.begin();
        tie(_, index) = *elem;
        cout << index+1 << " ";
        close.erase(elem);
        //cout << "1" << endl; 
        auto neighbor = *neighbors[index].begin();
        //cout << "2" << endl;
        auto a = indicies.upper_bound({neighbor, -1});
        //cout << "3" << endl;
        int ind, num;
        tie(ind, num) = *a;
        //cout << "4" << endl;

        indicies.erase(a);
        indicies.insert({ind, num-1});
        //cout << "5" << endl;
        //cout << "Close size: " << sz(close) << " contains " << num << " " << ind << endl;
        close.erase(close.find({num, ind}));
        close.insert({num-1, ind});
        //cout << "6" << endl;
        neighbors[index].erase(neighbors[index].begin());
        neighbors[neighbor].erase(neighbors[neighbor].find(index));
    } 

}


vector<int> distanceRemoved;
vector<vi> edges;
vector<vi> distances;


void calcDist() {
    rep(i, 0, n) {

        deque<tuple<int, int>> q = {{i, 0}};
        vector<bool> seen(n, false);

        while (!q.empty()) {
            int el, dist;
            tie(el, dist) = q.front();
            q.pop_front();
            if (seen[el])
                continue;
            seen[el] = true;

            distances[i][el] = dist;

            rep(j, 0, n) {
                if (edges[el][j] != 1)
                    continue;
                q.emplace_back(j, dist+1);
            }
        }
    }
}

bool possible(int lastnode, int ind) {
    calcDist();

    if (ind == n-1) {
        rep(i, 0, n) {
            rep(j, i+1, n) {
                if (edges[i][j] == 1)
                    cout << i+1 << " " << j+1 << endl;
            }
        }
        return true;
    }
    
    if (distanceRemoved[ind] == 1) {
        edges[lastnode][lastnode+1] = 1;
        edges[lastnode+1][lastnode] = 1;
        if (possible(lastnode+1, ind+1)) return true;
        edges[lastnode][lastnode+1] = 0;
        edges[lastnode+1][lastnode] = 0;
    }
    else {

        rep(i, 0, lastnode) {
            if (distances[i][lastnode] == distanceRemoved[ind]-1) {
                
                edges[lastnode+1][i] = 1;
                edges[i][lastnode+1] = 1;
                if (possible(lastnode+1, ind+1)) return true;
                edges[lastnode+1][i] = 0;
                edges[i][lastnode+1] = 0;
            }
        }
    }
    return false;
}

void genTree() {
    reverse(all(distanceRemoved));
    distances.assign(n, vi(n, 10000000));
    edges.assign(n, vi(n, 0));
    possible(0, 0);
}


int main() {

    cin >> t;
    cin >> n;
    if (t == 1) {
        int a, b;
        neighbors.assign(n, set<int>());
        rep(i, 0, n-1) {
            cin >> a >> b;
            neighbors[a-1].insert(b-1);
            neighbors[b-1].insert(a-1);
        }

        genList();
        return 0;
    }
    else if (t == 2) {
        int a;
        rep(i, 0, n-1) {
            cin >> a;
            distanceRemoved.push_back(a);
        }
        genTree();
    }
    return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`1 2 2 1` view save

correct output
(empty)

user output
(empty)

Test 2

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`1 3 3 1 2 1` view save

correct output
(empty)

user output
(empty)

Test 3

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 4

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 6

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 7

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 8

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 9

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 10

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 11

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 12

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 13

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 14

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 15

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

NOI 2019

Distance Code

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 (Ivar)