oj.uz

Submission #600903

# Submission time Handle Problem Language Result Execution time Memory
600903 2022-07-21T08:59:56 Z 이동현(#8470) Arranging Tickets (JOI17_arranging_tickets) C++17
0 / 100
 1 ms 324 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m; cin >> n >> m;
    vector<vector<int>> a(m, vector<int>(3));
    for(int i = 0; i < m; ++i){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        --a[i][0], --a[i][1];
        int len = (a[i][1] + n - a[i][0]) % n;
        if(len * 2 > n){
            swap(a[i][0], a[i][1]);
        }
    }
    sort(a.begin(), a.end(), [&](vector<int>&x, vector<int>&y)->bool{
        if(x[0] < y[0]) return 1;
        if(x[0] > y[0]) return 0;
        int xx = x[1], yy = y[1];
        if(xx < x[0]) xx += n;
        if(yy < y[0]) yy += n;
        return xx < yy;
    });
    int low = 0, high = (int)1e9, mid;
    while(low < high){
        mid = low + high >> 1;
        int can = 0;
        for(int s = 0; s < m; ++s){
            vector<int> cnt(n);
            for(int i = 0; i < m; ++i){
                int mx = 0;
                int pos = a[(s + i) % m][0];
                while(true){
                    mx = max(mx, cnt[pos]);
                    pos = (pos + 1) % n;
                    if(pos == a[(s + i) % m][1]) break;
                }
                if(mx < mid){
                    pos = a[(s + i) % m][0];
                    while(true){
                        ++cnt[pos];
                        pos = (pos + 1) % n;
                        if(pos == a[(s + i) % m][1]) break;
                    }
                }
                else{
                    pos = a[(s + i) % m][1];
                    while(true){
                        ++cnt[pos];
                        pos = (pos + 1) % n;
                        if(pos == a[(s + i) % m][0]) break;
                    }
                }
            }
            int mx = 0;
            for(int i = 0; i < n; ++i){
                mx = max(mx, cnt[i]);
            }
            if(mx <= mid){
                can = 1;
                break;
            }
        }
        if(can){
            high = mid;
        }
        else{
            low = mid + 1;
        }
    }
    cout << low << '\n';
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Incorrect 0 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Incorrect 0 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Incorrect 0 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Incorrect 0 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Incorrect 0 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -