oj.uz

Submission #294896

# Submission time Handle Problem Language Result Execution time Memory
294896 2020-09-09T10:23:26 Z BThero Arranging Tickets (JOI17_arranging_tickets) C++17
0 / 100
 970 ms 376 KB 
// chrono::system_clock::now().time_since_epoch().count()
#include<bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

vector<int> arr[25];
int cnt[25];
int n, m;

void solve() {
  scanf("%d %d", &n, &m);
  
  for (int i = 1; i <= m; ++i) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    assert(c == 1);
    
    while (a != b) {
      arr[i].pb(a);
      
      if (++a > n) {
        a = 1;
      }
    }
  }
  
  int ans = m;
  
  for (int mask = 0; mask < (1 << m); ++mask) {
    fill(cnt, cnt + n, 0);
  
    for (int i = 1; i <= m; ++i) {
      int x = 1;
    
      if ((mask >> i) & 1) {
        for (int j = 0; j < n; ++j) {
          cnt[j]++;
        } 
        
        x = -x;
      }
      
      for (int y : arr[i]) {
        cnt[y] += x;
      }
    }
    
    ans = min(ans, *max_element(cnt, cnt + n));
  }
  
  printf("%d\n", ans);
}

int main() {
  int tt = 1;
  
  while (tt--) {
    solve();
  }

  return 0;
}

Compilation message

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

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 364 KB Output is correct
2 Correct 906 ms 376 KB Output is correct
3 Correct 878 ms 376 KB Output is correct
4 Correct 844 ms 376 KB Output is correct
5 Correct 924 ms 256 KB Output is correct
6 Correct 885 ms 376 KB Output is correct
7 Correct 943 ms 376 KB Output is correct
8 Correct 900 ms 376 KB Output is correct
9 Incorrect 932 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 364 KB Output is correct
2 Correct 906 ms 376 KB Output is correct
3 Correct 878 ms 376 KB Output is correct
4 Correct 844 ms 376 KB Output is correct
5 Correct 924 ms 256 KB Output is correct
6 Correct 885 ms 376 KB Output is correct
7 Correct 943 ms 376 KB Output is correct
8 Correct 900 ms 376 KB Output is correct
9 Incorrect 932 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 364 KB Output is correct
2 Correct 906 ms 376 KB Output is correct
3 Correct 878 ms 376 KB Output is correct
4 Correct 844 ms 376 KB Output is correct
5 Correct 924 ms 256 KB Output is correct
6 Correct 885 ms 376 KB Output is correct
7 Correct 943 ms 376 KB Output is correct
8 Correct 900 ms 376 KB Output is correct
9 Incorrect 932 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 364 KB Output is correct
2 Correct 906 ms 376 KB Output is correct
3 Correct 878 ms 376 KB Output is correct
4 Correct 844 ms 376 KB Output is correct
5 Correct 924 ms 256 KB Output is correct
6 Correct 885 ms 376 KB Output is correct
7 Correct 943 ms 376 KB Output is correct
8 Correct 900 ms 376 KB Output is correct
9 Incorrect 932 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 364 KB Output is correct
2 Correct 906 ms 376 KB Output is correct
3 Correct 878 ms 376 KB Output is correct
4 Correct 844 ms 376 KB Output is correct
5 Correct 924 ms 256 KB Output is correct
6 Correct 885 ms 376 KB Output is correct
7 Correct 943 ms 376 KB Output is correct
8 Correct 900 ms 376 KB Output is correct
9 Incorrect 932 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -