oj.uz

Submission #565061

# Submission time Handle Problem Language Result Execution time Memory
565061 2022-05-20T08:30:51 Z dantoh000 Arranging Tickets (JOI17_arranging_tickets) C++14
10 / 100
 231 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m;
int a[25], b[25], c[25];
int x[25];
int main(){
    scanf("%d%d",&n,&m);
    for (int i = 0; i < m; i++){
        scanf("%d%d%d",&a[i],&b[i],&c[i]);
        if (a[i] > b[i]) swap(a[i],b[i]);
    }
    int ans = m;
    for (int mask = 0; mask < (1<<m); mask++){
        for (int i = 1; i <= n; i++){
            x[i] = 0;
        }
        int ct = 0;
        for (int i = 0; i < m; i++){
            if ((mask>>i)&1){
                for (int j = a[i]; j < b[i]; j++){
                    x[j]++;
                }
            }
            else{
                ct++;
                for (int j = a[i]; j < b[i]; j++){
                    x[j]--;
                }
            }
        }
        int mx = 0;
        for (int i = 1; i <= n; i++){
            mx = max(mx, x[i]);
        }
        ans = min(ans,mx+ct);
    }
    printf("%d\n",ans);


}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 280 KB Output is correct
2 Correct 183 ms 284 KB Output is correct
3 Correct 227 ms 280 KB Output is correct
4 Correct 178 ms 284 KB Output is correct
5 Correct 178 ms 292 KB Output is correct
6 Correct 229 ms 284 KB Output is correct
7 Correct 190 ms 280 KB Output is correct
8 Correct 181 ms 212 KB Output is correct
9 Correct 216 ms 280 KB Output is correct
10 Correct 192 ms 280 KB Output is correct
11 Correct 204 ms 284 KB Output is correct
12 Correct 231 ms 280 KB Output is correct
13 Correct 204 ms 276 KB Output is correct
14 Correct 188 ms 332 KB Output is correct
15 Correct 200 ms 280 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 280 KB Output is correct
2 Correct 183 ms 284 KB Output is correct
3 Correct 227 ms 280 KB Output is correct
4 Correct 178 ms 284 KB Output is correct
5 Correct 178 ms 292 KB Output is correct
6 Correct 229 ms 284 KB Output is correct
7 Correct 190 ms 280 KB Output is correct
8 Correct 181 ms 212 KB Output is correct
9 Correct 216 ms 280 KB Output is correct
10 Correct 192 ms 280 KB Output is correct
11 Correct 204 ms 284 KB Output is correct
12 Correct 231 ms 280 KB Output is correct
13 Correct 204 ms 276 KB Output is correct
14 Correct 188 ms 332 KB Output is correct
15 Correct 200 ms 280 KB Output is correct
16 Incorrect 1 ms 212 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 280 KB Output is correct
2 Correct 183 ms 284 KB Output is correct
3 Correct 227 ms 280 KB Output is correct
4 Correct 178 ms 284 KB Output is correct
5 Correct 178 ms 292 KB Output is correct
6 Correct 229 ms 284 KB Output is correct
7 Correct 190 ms 280 KB Output is correct
8 Correct 181 ms 212 KB Output is correct
9 Correct 216 ms 280 KB Output is correct
10 Correct 192 ms 280 KB Output is correct
11 Correct 204 ms 284 KB Output is correct
12 Correct 231 ms 280 KB Output is correct
13 Correct 204 ms 276 KB Output is correct
14 Correct 188 ms 332 KB Output is correct
15 Correct 200 ms 280 KB Output is correct
16 Incorrect 1 ms 212 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 280 KB Output is correct
2 Correct 183 ms 284 KB Output is correct
3 Correct 227 ms 280 KB Output is correct
4 Correct 178 ms 284 KB Output is correct
5 Correct 178 ms 292 KB Output is correct
6 Correct 229 ms 284 KB Output is correct
7 Correct 190 ms 280 KB Output is correct
8 Correct 181 ms 212 KB Output is correct
9 Correct 216 ms 280 KB Output is correct
10 Correct 192 ms 280 KB Output is correct
11 Correct 204 ms 284 KB Output is correct
12 Correct 231 ms 280 KB Output is correct
13 Correct 204 ms 276 KB Output is correct
14 Correct 188 ms 332 KB Output is correct
15 Correct 200 ms 280 KB Output is correct
16 Incorrect 1 ms 212 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 280 KB Output is correct
2 Correct 183 ms 284 KB Output is correct
3 Correct 227 ms 280 KB Output is correct
4 Correct 178 ms 284 KB Output is correct
5 Correct 178 ms 292 KB Output is correct
6 Correct 229 ms 284 KB Output is correct
7 Correct 190 ms 280 KB Output is correct
8 Correct 181 ms 212 KB Output is correct
9 Correct 216 ms 280 KB Output is correct
10 Correct 192 ms 280 KB Output is correct
11 Correct 204 ms 284 KB Output is correct
12 Correct 231 ms 280 KB Output is correct
13 Correct 204 ms 276 KB Output is correct
14 Correct 188 ms 332 KB Output is correct
15 Correct 200 ms 280 KB Output is correct
16 Incorrect 1 ms 212 KB Output isn't correct
17 Halted 0 ms 0 KB -