Submission #294902

# Submission time Handle Problem Language Result Execution time Memory
294902 2020-09-09T10:26:34 Z BThero Arranging Tickets (JOI17_arranging_tickets) C++17
10 / 100
975 ms 512 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 = 0; i < m; ++i) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    assert(c == 1);
    --a;
    --b;
    
    while (a != b) {
      arr[i].pb(a);
      a = (a + 1) % n;
    }
  }
  
  int ans = m;
  
  for (int mask = 0; mask < (1 << m); ++mask) {
    fill(cnt, cnt + n, 0);
  
    for (int i = 0; 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);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 942 ms 376 KB Output is correct
2 Correct 905 ms 364 KB Output is correct
3 Correct 863 ms 376 KB Output is correct
4 Correct 817 ms 376 KB Output is correct
5 Correct 897 ms 356 KB Output is correct
6 Correct 861 ms 376 KB Output is correct
7 Correct 934 ms 360 KB Output is correct
8 Correct 862 ms 376 KB Output is correct
9 Correct 933 ms 360 KB Output is correct
10 Correct 794 ms 380 KB Output is correct
11 Correct 886 ms 376 KB Output is correct
12 Correct 975 ms 376 KB Output is correct
13 Correct 897 ms 376 KB Output is correct
14 Correct 867 ms 376 KB Output is correct
15 Correct 849 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 942 ms 376 KB Output is correct
2 Correct 905 ms 364 KB Output is correct
3 Correct 863 ms 376 KB Output is correct
4 Correct 817 ms 376 KB Output is correct
5 Correct 897 ms 356 KB Output is correct
6 Correct 861 ms 376 KB Output is correct
7 Correct 934 ms 360 KB Output is correct
8 Correct 862 ms 376 KB Output is correct
9 Correct 933 ms 360 KB Output is correct
10 Correct 794 ms 380 KB Output is correct
11 Correct 886 ms 376 KB Output is correct
12 Correct 975 ms 376 KB Output is correct
13 Correct 897 ms 376 KB Output is correct
14 Correct 867 ms 376 KB Output is correct
15 Correct 849 ms 364 KB Output is correct
16 Runtime error 1 ms 512 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 942 ms 376 KB Output is correct
2 Correct 905 ms 364 KB Output is correct
3 Correct 863 ms 376 KB Output is correct
4 Correct 817 ms 376 KB Output is correct
5 Correct 897 ms 356 KB Output is correct
6 Correct 861 ms 376 KB Output is correct
7 Correct 934 ms 360 KB Output is correct
8 Correct 862 ms 376 KB Output is correct
9 Correct 933 ms 360 KB Output is correct
10 Correct 794 ms 380 KB Output is correct
11 Correct 886 ms 376 KB Output is correct
12 Correct 975 ms 376 KB Output is correct
13 Correct 897 ms 376 KB Output is correct
14 Correct 867 ms 376 KB Output is correct
15 Correct 849 ms 364 KB Output is correct
16 Runtime error 1 ms 512 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 942 ms 376 KB Output is correct
2 Correct 905 ms 364 KB Output is correct
3 Correct 863 ms 376 KB Output is correct
4 Correct 817 ms 376 KB Output is correct
5 Correct 897 ms 356 KB Output is correct
6 Correct 861 ms 376 KB Output is correct
7 Correct 934 ms 360 KB Output is correct
8 Correct 862 ms 376 KB Output is correct
9 Correct 933 ms 360 KB Output is correct
10 Correct 794 ms 380 KB Output is correct
11 Correct 886 ms 376 KB Output is correct
12 Correct 975 ms 376 KB Output is correct
13 Correct 897 ms 376 KB Output is correct
14 Correct 867 ms 376 KB Output is correct
15 Correct 849 ms 364 KB Output is correct
16 Runtime error 1 ms 512 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 942 ms 376 KB Output is correct
2 Correct 905 ms 364 KB Output is correct
3 Correct 863 ms 376 KB Output is correct
4 Correct 817 ms 376 KB Output is correct
5 Correct 897 ms 356 KB Output is correct
6 Correct 861 ms 376 KB Output is correct
7 Correct 934 ms 360 KB Output is correct
8 Correct 862 ms 376 KB Output is correct
9 Correct 933 ms 360 KB Output is correct
10 Correct 794 ms 380 KB Output is correct
11 Correct 886 ms 376 KB Output is correct
12 Correct 975 ms 376 KB Output is correct
13 Correct 897 ms 376 KB Output is correct
14 Correct 867 ms 376 KB Output is correct
15 Correct 849 ms 364 KB Output is correct
16 Runtime error 1 ms 512 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -