oj.uz

Submission #90361

# Submission time Handle Problem Language Result Execution time Memory
90361 2018-12-21T10:52:28 Z Alexa2001 Arranging Tickets (JOI17_arranging_tickets) C++17
85 / 100
 677 ms 32880 KB 
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 2e5 + 5;

priority_queue<int> heap;
int start[Nmax], finish[Nmax], add[Nmax], dp[Nmax], s[Nmax];
vector<int> v[Nmax];
int n, m, i, A, B;
vector< pair<int,int> > edges;

int mod(int x)
{
    if(x <= 0) return x+n;
    if(x>n) return x-n;
    return x;
}

bool check_center(int where, int L)
{
    int i, need = 0, nr;

    for(i=1; i<=n; ++i) v[i].clear();

    for(auto e : edges)
    {
        int x, y;
        x = mod(e.first - where + 1);
        y = mod(e.second - where + 1);

        if(x > y) swap(x, y);
        v[x].push_back(y);
    }

    while(heap.size()) heap.pop();

    for(i=1; i<=n; ++i) finish[i] = 0;

    for(i=1; i<=n; ++i)
    {
        start[i] = v[i].size(); add[i] = 0;
        for(auto it : v[i]) finish[it] ++;
    }

    dp[0] = L;
    for(i=1; i<n; ++i)
    {
        for(auto it : v[i]) heap.push(it);

        dp[i] = dp[i-1] + start[i] - finish[i] + add[i];

        while(dp[i] > L && need <= L)
        {
            assert(heap.size());

            dp[i] -= 2;
            nr = heap.top();
            heap.pop();
            add[nr] += 2;
            ++need;
        }

        if(need > L) return 0;
    }

    return (need <= L);
}

bool check(int L)
{
    int i;
    for(i=1; i<=n; ++i)
        return (check_center(A, L) || check_center(B, L));
}

int best_point(bool dir)
{
    int i;
    for(i=1; i<=n; ++i)
        s[i] = 0;

    for(auto e : edges)
        if(dir == 0)
        {
            ++s[e.first];
            --s[e.second];
        }
        else
        {
            ++s[e.second];
            ++s[1];
            --s[e.first];
        }

    for(i=1; i<=n; ++i) s[i] += s[i-1];

    int Max = 0;
    for(i=1; i<=n; ++i) Max = max(Max, s[i]);
    for(i=1; i<=n; ++i)
        if(Max == s[i]) return mod(i+1);
}

int main()
{
 //   freopen("input", "r", stdin);

    cin >> n >> m;

    int i, x, y, C;
    for(i=1; i<=m; ++i)
    {
        cin >> x >> y >> C;
        if(x > y) swap(x, y);
        edges.push_back({x, y});
    }

    A = best_point(0);
    B = best_point(1);

    int st = 0, dr = m, mid;
    while(st <= dr)
    {
        mid = (st+dr) / 2;
        if(check(mid)) dr = mid - 1;
            else st = mid + 1;
    }

    cout << st << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 5 ms 5152 KB Output is correct
6 Correct 5 ms 5216 KB Output is correct
7 Correct 5 ms 5288 KB Output is correct
8 Correct 5 ms 5328 KB Output is correct
9 Correct 5 ms 5328 KB Output is correct
10 Correct 5 ms 5328 KB Output is correct
11 Correct 5 ms 5328 KB Output is correct
12 Correct 5 ms 5328 KB Output is correct
13 Correct 5 ms 5328 KB Output is correct
14 Correct 5 ms 5328 KB Output is correct
15 Correct 6 ms 5344 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 5 ms 5152 KB Output is correct
6 Correct 5 ms 5216 KB Output is correct
7 Correct 5 ms 5288 KB Output is correct
8 Correct 5 ms 5328 KB Output is correct
9 Correct 5 ms 5328 KB Output is correct
10 Correct 5 ms 5328 KB Output is correct
11 Correct 5 ms 5328 KB Output is correct
12 Correct 5 ms 5328 KB Output is correct
13 Correct 5 ms 5328 KB Output is correct
14 Correct 5 ms 5328 KB Output is correct
15 Correct 6 ms 5344 KB Output is correct
16 Correct 6 ms 5344 KB Output is correct
17 Correct 6 ms 5344 KB Output is correct
18 Correct 5 ms 5344 KB Output is correct
19 Correct 13 ms 5344 KB Output is correct
20 Correct 5 ms 5344 KB Output is correct
21 Correct 6 ms 5344 KB Output is correct
22 Correct 5 ms 5344 KB Output is correct
23 Correct 5 ms 5344 KB Output is correct
24 Correct 5 ms 5344 KB Output is correct
25 Correct 6 ms 5344 KB Output is correct
26 Correct 6 ms 5344 KB Output is correct
27 Correct 6 ms 5344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 5 ms 5152 KB Output is correct
6 Correct 5 ms 5216 KB Output is correct
7 Correct 5 ms 5288 KB Output is correct
8 Correct 5 ms 5328 KB Output is correct
9 Correct 5 ms 5328 KB Output is correct
10 Correct 5 ms 5328 KB Output is correct
11 Correct 5 ms 5328 KB Output is correct
12 Correct 5 ms 5328 KB Output is correct
13 Correct 5 ms 5328 KB Output is correct
14 Correct 5 ms 5328 KB Output is correct
15 Correct 6 ms 5344 KB Output is correct
16 Correct 6 ms 5344 KB Output is correct
17 Correct 6 ms 5344 KB Output is correct
18 Correct 5 ms 5344 KB Output is correct
19 Correct 13 ms 5344 KB Output is correct
20 Correct 5 ms 5344 KB Output is correct
21 Correct 6 ms 5344 KB Output is correct
22 Correct 5 ms 5344 KB Output is correct
23 Correct 5 ms 5344 KB Output is correct
24 Correct 5 ms 5344 KB Output is correct
25 Correct 6 ms 5344 KB Output is correct
26 Correct 6 ms 5344 KB Output is correct
27 Correct 6 ms 5344 KB Output is correct
28 Correct 11 ms 5344 KB Output is correct
29 Correct 14 ms 5472 KB Output is correct
30 Correct 12 ms 5472 KB Output is correct
31 Correct 13 ms 5508 KB Output is correct
32 Correct 12 ms 5592 KB Output is correct
33 Correct 15 ms 5624 KB Output is correct
34 Correct 32 ms 5708 KB Output is correct
35 Correct 12 ms 5740 KB Output is correct
36 Correct 11 ms 5772 KB Output is correct
37 Correct 10 ms 5824 KB Output is correct
38 Correct 10 ms 5876 KB Output is correct
39 Correct 10 ms 5916 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 5 ms 5152 KB Output is correct
6 Correct 5 ms 5216 KB Output is correct
7 Correct 5 ms 5288 KB Output is correct
8 Correct 5 ms 5328 KB Output is correct
9 Correct 5 ms 5328 KB Output is correct
10 Correct 5 ms 5328 KB Output is correct
11 Correct 5 ms 5328 KB Output is correct
12 Correct 5 ms 5328 KB Output is correct
13 Correct 5 ms 5328 KB Output is correct
14 Correct 5 ms 5328 KB Output is correct
15 Correct 6 ms 5344 KB Output is correct
16 Correct 6 ms 5344 KB Output is correct
17 Correct 6 ms 5344 KB Output is correct
18 Correct 5 ms 5344 KB Output is correct
19 Correct 13 ms 5344 KB Output is correct
20 Correct 5 ms 5344 KB Output is correct
21 Correct 6 ms 5344 KB Output is correct
22 Correct 5 ms 5344 KB Output is correct
23 Correct 5 ms 5344 KB Output is correct
24 Correct 5 ms 5344 KB Output is correct
25 Correct 6 ms 5344 KB Output is correct
26 Correct 6 ms 5344 KB Output is correct
27 Correct 6 ms 5344 KB Output is correct
28 Correct 11 ms 5344 KB Output is correct
29 Correct 14 ms 5472 KB Output is correct
30 Correct 12 ms 5472 KB Output is correct
31 Correct 13 ms 5508 KB Output is correct
32 Correct 12 ms 5592 KB Output is correct
33 Correct 15 ms 5624 KB Output is correct
34 Correct 32 ms 5708 KB Output is correct
35 Correct 12 ms 5740 KB Output is correct
36 Correct 11 ms 5772 KB Output is correct
37 Correct 10 ms 5824 KB Output is correct
38 Correct 10 ms 5876 KB Output is correct
39 Correct 10 ms 5916 KB Output is correct
40 Correct 582 ms 15276 KB Output is correct
41 Correct 509 ms 16848 KB Output is correct
42 Correct 633 ms 18356 KB Output is correct
43 Correct 677 ms 19488 KB Output is correct
44 Correct 559 ms 21016 KB Output is correct
45 Correct 589 ms 22144 KB Output is correct
46 Correct 484 ms 23488 KB Output is correct
47 Correct 517 ms 24756 KB Output is correct
48 Correct 479 ms 26292 KB Output is correct
49 Correct 342 ms 26292 KB Output is correct
50 Correct 270 ms 27628 KB Output is correct
51 Correct 323 ms 28200 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 5 ms 5152 KB Output is correct
6 Correct 5 ms 5216 KB Output is correct
7 Correct 5 ms 5288 KB Output is correct
8 Correct 5 ms 5328 KB Output is correct
9 Correct 5 ms 5328 KB Output is correct
10 Correct 5 ms 5328 KB Output is correct
11 Correct 5 ms 5328 KB Output is correct
12 Correct 5 ms 5328 KB Output is correct
13 Correct 5 ms 5328 KB Output is correct
14 Correct 5 ms 5328 KB Output is correct
15 Correct 6 ms 5344 KB Output is correct
16 Correct 6 ms 5344 KB Output is correct
17 Correct 6 ms 5344 KB Output is correct
18 Correct 5 ms 5344 KB Output is correct
19 Correct 13 ms 5344 KB Output is correct
20 Correct 5 ms 5344 KB Output is correct
21 Correct 6 ms 5344 KB Output is correct
22 Correct 5 ms 5344 KB Output is correct
23 Correct 5 ms 5344 KB Output is correct
24 Correct 5 ms 5344 KB Output is correct
25 Correct 6 ms 5344 KB Output is correct
26 Correct 6 ms 5344 KB Output is correct
27 Correct 6 ms 5344 KB Output is correct
28 Correct 11 ms 5344 KB Output is correct
29 Correct 14 ms 5472 KB Output is correct
30 Correct 12 ms 5472 KB Output is correct
31 Correct 13 ms 5508 KB Output is correct
32 Correct 12 ms 5592 KB Output is correct
33 Correct 15 ms 5624 KB Output is correct
34 Correct 32 ms 5708 KB Output is correct
35 Correct 12 ms 5740 KB Output is correct
36 Correct 11 ms 5772 KB Output is correct
37 Correct 10 ms 5824 KB Output is correct
38 Correct 10 ms 5876 KB Output is correct
39 Correct 10 ms 5916 KB Output is correct
40 Correct 582 ms 15276 KB Output is correct
41 Correct 509 ms 16848 KB Output is correct
42 Correct 633 ms 18356 KB Output is correct
43 Correct 677 ms 19488 KB Output is correct
44 Correct 559 ms 21016 KB Output is correct
45 Correct 589 ms 22144 KB Output is correct
46 Correct 484 ms 23488 KB Output is correct
47 Correct 517 ms 24756 KB Output is correct
48 Correct 479 ms 26292 KB Output is correct
49 Correct 342 ms 26292 KB Output is correct
50 Correct 270 ms 27628 KB Output is correct
51 Correct 323 ms 28200 KB Output is correct
52 Incorrect 671 ms 32880 KB Output isn't correct
53 Halted 0 ms 0 KB -