oj.uz

Submission #600840

# Submission time Handle Problem Language Result Execution time Memory
600840 2022-07-21T08:12:28 Z 조영욱(#8469) Arranging Tickets (JOI17_arranging_tickets) C++17
10 / 100
 6000 ms 284 KB 
#include <bits/stdc++.h>
using namespace std;

int arr[20];
int cnt1[20];
int cnt2[20];
int n,m;
int l[20];
int r[20];
int val[20];

int main() {
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++) {
        scanf("%d %d %d",&l[i],&r[i],&val[i]);
        l[i]--;
        r[i]--;
    }
    int ret=20;
    for(int bit=0;bit<(1<<m);bit++) {
        memset(cnt1,0,sizeof(cnt1));
        for(int i=0;i<m;i++) {
            if (bit&(1<<i)) {
                int now=l[i];
                while (now!=r[i]) {
                    cnt1[now]++;
                    now++;
                    if (now==n) {
                        now=0;
                    }
                }
            }
            else {
                int now=l[i];
                while (now!=r[i]) {
                    now--;
                    if (now==-1) {
                        now=n-1;
                    }
                    cnt1[now]++;
                }
            }
        }
        int mx=0;
        for(int i=0;i<n;i++) {
            mx=max(mx,cnt1[i]);
        }
        ret=min(ret,mx);
    }
    printf("%d",ret);
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
arranging_tickets.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d %d %d",&l[i],&r[i],&val[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 272 KB Output is correct
2 Correct 329 ms 212 KB Output is correct
3 Correct 344 ms 212 KB Output is correct
4 Correct 327 ms 276 KB Output is correct
5 Correct 340 ms 272 KB Output is correct
6 Correct 315 ms 272 KB Output is correct
7 Correct 331 ms 280 KB Output is correct
8 Correct 323 ms 276 KB Output is correct
9 Correct 339 ms 272 KB Output is correct
10 Correct 332 ms 272 KB Output is correct
11 Correct 339 ms 272 KB Output is correct
12 Correct 325 ms 272 KB Output is correct
13 Correct 332 ms 276 KB Output is correct
14 Correct 331 ms 276 KB Output is correct
15 Correct 329 ms 284 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 272 KB Output is correct
2 Correct 329 ms 212 KB Output is correct
3 Correct 344 ms 212 KB Output is correct
4 Correct 327 ms 276 KB Output is correct
5 Correct 340 ms 272 KB Output is correct
6 Correct 315 ms 272 KB Output is correct
7 Correct 331 ms 280 KB Output is correct
8 Correct 323 ms 276 KB Output is correct
9 Correct 339 ms 272 KB Output is correct
10 Correct 332 ms 272 KB Output is correct
11 Correct 339 ms 272 KB Output is correct
12 Correct 325 ms 272 KB Output is correct
13 Correct 332 ms 276 KB Output is correct
14 Correct 331 ms 276 KB Output is correct
15 Correct 329 ms 284 KB Output is correct
16 Execution timed out 6082 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 272 KB Output is correct
2 Correct 329 ms 212 KB Output is correct
3 Correct 344 ms 212 KB Output is correct
4 Correct 327 ms 276 KB Output is correct
5 Correct 340 ms 272 KB Output is correct
6 Correct 315 ms 272 KB Output is correct
7 Correct 331 ms 280 KB Output is correct
8 Correct 323 ms 276 KB Output is correct
9 Correct 339 ms 272 KB Output is correct
10 Correct 332 ms 272 KB Output is correct
11 Correct 339 ms 272 KB Output is correct
12 Correct 325 ms 272 KB Output is correct
13 Correct 332 ms 276 KB Output is correct
14 Correct 331 ms 276 KB Output is correct
15 Correct 329 ms 284 KB Output is correct
16 Execution timed out 6082 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 272 KB Output is correct
2 Correct 329 ms 212 KB Output is correct
3 Correct 344 ms 212 KB Output is correct
4 Correct 327 ms 276 KB Output is correct
5 Correct 340 ms 272 KB Output is correct
6 Correct 315 ms 272 KB Output is correct
7 Correct 331 ms 280 KB Output is correct
8 Correct 323 ms 276 KB Output is correct
9 Correct 339 ms 272 KB Output is correct
10 Correct 332 ms 272 KB Output is correct
11 Correct 339 ms 272 KB Output is correct
12 Correct 325 ms 272 KB Output is correct
13 Correct 332 ms 276 KB Output is correct
14 Correct 331 ms 276 KB Output is correct
15 Correct 329 ms 284 KB Output is correct
16 Execution timed out 6082 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 272 KB Output is correct
2 Correct 329 ms 212 KB Output is correct
3 Correct 344 ms 212 KB Output is correct
4 Correct 327 ms 276 KB Output is correct
5 Correct 340 ms 272 KB Output is correct
6 Correct 315 ms 272 KB Output is correct
7 Correct 331 ms 280 KB Output is correct
8 Correct 323 ms 276 KB Output is correct
9 Correct 339 ms 272 KB Output is correct
10 Correct 332 ms 272 KB Output is correct
11 Correct 339 ms 272 KB Output is correct
12 Correct 325 ms 272 KB Output is correct
13 Correct 332 ms 276 KB Output is correct
14 Correct 331 ms 276 KB Output is correct
15 Correct 329 ms 284 KB Output is correct
16 Execution timed out 6082 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -