oj.uz

답안 #959069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959069 2024-04-07T12:56:15 Z Abito Arranging Tickets (JOI17_arranging_tickets) C++17
10 / 100
 6000 ms 4688 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int N=2e5+5;
int a[N],b[N],n,m,f[N];
int rec(int i,int mx){
    //cout<<i<<endl;
    //for (int j=0;j<n;j++) cout<<f[j]<<' ';cout<<endl<<endl;
    if (i>m) return mx;
    int x=mx;
    for (int j=a[i];j!=b[i];j=(j+1)%n){
        f[j]++;
        x=max(x,f[j]);
    }int ans=rec(i+1,x);
    for (int j=a[i];j!=b[i];j=(j+1)%n) f[j]--;
    x=mx;
    for (int j=b[i];j!=a[i];j=(j+1)%n){
        f[j]++;
        x=max(x,f[j]);
    }ans=min(ans,rec(i+1,x));
    for (int j=b[i];j!=a[i];j=(j+1)%n) f[j]--;
    return ans;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>m;
    for (int i=1;i<=m;i++){
        cin>>a[i]>>b[i];
        int c;cin>>c;
        a[i]--;
        b[i]--;
    }cout<<rec(1,0)<<endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 4544 KB Output is correct
2 Correct 181 ms 4540 KB Output is correct
3 Correct 181 ms 4444 KB Output is correct
4 Correct 181 ms 4440 KB Output is correct
5 Correct 181 ms 4536 KB Output is correct
6 Correct 181 ms 4540 KB Output is correct
7 Correct 182 ms 4444 KB Output is correct
8 Correct 181 ms 4444 KB Output is correct
9 Correct 181 ms 4536 KB Output is correct
10 Correct 181 ms 4444 KB Output is correct
11 Correct 181 ms 4688 KB Output is correct
12 Correct 181 ms 4536 KB Output is correct
13 Correct 182 ms 4540 KB Output is correct
14 Correct 180 ms 4444 KB Output is correct
15 Correct 181 ms 4440 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 4544 KB Output is correct
2 Correct 181 ms 4540 KB Output is correct
3 Correct 181 ms 4444 KB Output is correct
4 Correct 181 ms 4440 KB Output is correct
5 Correct 181 ms 4536 KB Output is correct
6 Correct 181 ms 4540 KB Output is correct
7 Correct 182 ms 4444 KB Output is correct
8 Correct 181 ms 4444 KB Output is correct
9 Correct 181 ms 4536 KB Output is correct
10 Correct 181 ms 4444 KB Output is correct
11 Correct 181 ms 4688 KB Output is correct
12 Correct 181 ms 4536 KB Output is correct
13 Correct 182 ms 4540 KB Output is correct
14 Correct 180 ms 4444 KB Output is correct
15 Correct 181 ms 4440 KB Output is correct
16 Execution timed out 6055 ms 4440 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 4544 KB Output is correct
2 Correct 181 ms 4540 KB Output is correct
3 Correct 181 ms 4444 KB Output is correct
4 Correct 181 ms 4440 KB Output is correct
5 Correct 181 ms 4536 KB Output is correct
6 Correct 181 ms 4540 KB Output is correct
7 Correct 182 ms 4444 KB Output is correct
8 Correct 181 ms 4444 KB Output is correct
9 Correct 181 ms 4536 KB Output is correct
10 Correct 181 ms 4444 KB Output is correct
11 Correct 181 ms 4688 KB Output is correct
12 Correct 181 ms 4536 KB Output is correct
13 Correct 182 ms 4540 KB Output is correct
14 Correct 180 ms 4444 KB Output is correct
15 Correct 181 ms 4440 KB Output is correct
16 Execution timed out 6055 ms 4440 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 4544 KB Output is correct
2 Correct 181 ms 4540 KB Output is correct
3 Correct 181 ms 4444 KB Output is correct
4 Correct 181 ms 4440 KB Output is correct
5 Correct 181 ms 4536 KB Output is correct
6 Correct 181 ms 4540 KB Output is correct
7 Correct 182 ms 4444 KB Output is correct
8 Correct 181 ms 4444 KB Output is correct
9 Correct 181 ms 4536 KB Output is correct
10 Correct 181 ms 4444 KB Output is correct
11 Correct 181 ms 4688 KB Output is correct
12 Correct 181 ms 4536 KB Output is correct
13 Correct 182 ms 4540 KB Output is correct
14 Correct 180 ms 4444 KB Output is correct
15 Correct 181 ms 4440 KB Output is correct
16 Execution timed out 6055 ms 4440 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 4544 KB Output is correct
2 Correct 181 ms 4540 KB Output is correct
3 Correct 181 ms 4444 KB Output is correct
4 Correct 181 ms 4440 KB Output is correct
5 Correct 181 ms 4536 KB Output is correct
6 Correct 181 ms 4540 KB Output is correct
7 Correct 182 ms 4444 KB Output is correct
8 Correct 181 ms 4444 KB Output is correct
9 Correct 181 ms 4536 KB Output is correct
10 Correct 181 ms 4444 KB Output is correct
11 Correct 181 ms 4688 KB Output is correct
12 Correct 181 ms 4536 KB Output is correct
13 Correct 182 ms 4540 KB Output is correct
14 Correct 180 ms 4444 KB Output is correct
15 Correct 181 ms 4440 KB Output is correct
16 Execution timed out 6055 ms 4440 KB Time limit exceeded
17 Halted 0 ms 0 KB -