oj.uz

Submission #408255

# Submission time Handle Problem Language Result Execution time Memory
408255 2021-05-19T06:37:59 Z Mamnoon_Siam Arranging Tickets (JOI17_arranging_tickets) C++17
10 / 100
 1287 ms 296 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second

int main(int argc, char const *argv[])
{
#ifdef LOCAL
  freopen("in", "r", stdin);
#endif
  int n, m;
  scanf("%d %d", &n, &m);
  vi a(m), b(m), c(m);
  for(int i = 0; i < m; ++i) {
    scanf("%d %d %d", &a[i], &b[i], &c[i]);
    a[i]--, b[i]--;
  }
  ll ans = LLONG_MAX;
  for(int msk = 0; msk < (1 << m); ++msk) {
    vector<ll> cnt(n);
    for(int i = 0; i < m; ++i) {
      int from = a[i], to = b[i];
      if(msk >> i & 1) swap(from, to);
      for(int j = from; j != to; j = (j+1)%n) {
        cnt[j] += c[i];
      }
    }
    ans = min(ans, *max_element(all(cnt)));
  }
  printf("%lld\n", ans);
  return 0;
}
/*
* use std::array instead of std::vector, if u can
* overflow?
* array bounds
*/

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1243 ms 268 KB Output is correct
2 Correct 1246 ms 272 KB Output is correct
3 Correct 1247 ms 268 KB Output is correct
4 Correct 1234 ms 272 KB Output is correct
5 Correct 1229 ms 204 KB Output is correct
6 Correct 1252 ms 204 KB Output is correct
7 Correct 1250 ms 272 KB Output is correct
8 Correct 1279 ms 204 KB Output is correct
9 Correct 1247 ms 272 KB Output is correct
10 Correct 1278 ms 280 KB Output is correct
11 Correct 1282 ms 272 KB Output is correct
12 Correct 1287 ms 204 KB Output is correct
13 Correct 1280 ms 296 KB Output is correct
14 Correct 1256 ms 268 KB Output is correct
15 Correct 1233 ms 268 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1243 ms 268 KB Output is correct
2 Correct 1246 ms 272 KB Output is correct
3 Correct 1247 ms 268 KB Output is correct
4 Correct 1234 ms 272 KB Output is correct
5 Correct 1229 ms 204 KB Output is correct
6 Correct 1252 ms 204 KB Output is correct
7 Correct 1250 ms 272 KB Output is correct
8 Correct 1279 ms 204 KB Output is correct
9 Correct 1247 ms 272 KB Output is correct
10 Correct 1278 ms 280 KB Output is correct
11 Correct 1282 ms 272 KB Output is correct
12 Correct 1287 ms 204 KB Output is correct
13 Correct 1280 ms 296 KB Output is correct
14 Correct 1256 ms 268 KB Output is correct
15 Correct 1233 ms 268 KB Output is correct
16 Incorrect 1032 ms 276 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1243 ms 268 KB Output is correct
2 Correct 1246 ms 272 KB Output is correct
3 Correct 1247 ms 268 KB Output is correct
4 Correct 1234 ms 272 KB Output is correct
5 Correct 1229 ms 204 KB Output is correct
6 Correct 1252 ms 204 KB Output is correct
7 Correct 1250 ms 272 KB Output is correct
8 Correct 1279 ms 204 KB Output is correct
9 Correct 1247 ms 272 KB Output is correct
10 Correct 1278 ms 280 KB Output is correct
11 Correct 1282 ms 272 KB Output is correct
12 Correct 1287 ms 204 KB Output is correct
13 Correct 1280 ms 296 KB Output is correct
14 Correct 1256 ms 268 KB Output is correct
15 Correct 1233 ms 268 KB Output is correct
16 Incorrect 1032 ms 276 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1243 ms 268 KB Output is correct
2 Correct 1246 ms 272 KB Output is correct
3 Correct 1247 ms 268 KB Output is correct
4 Correct 1234 ms 272 KB Output is correct
5 Correct 1229 ms 204 KB Output is correct
6 Correct 1252 ms 204 KB Output is correct
7 Correct 1250 ms 272 KB Output is correct
8 Correct 1279 ms 204 KB Output is correct
9 Correct 1247 ms 272 KB Output is correct
10 Correct 1278 ms 280 KB Output is correct
11 Correct 1282 ms 272 KB Output is correct
12 Correct 1287 ms 204 KB Output is correct
13 Correct 1280 ms 296 KB Output is correct
14 Correct 1256 ms 268 KB Output is correct
15 Correct 1233 ms 268 KB Output is correct
16 Incorrect 1032 ms 276 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1243 ms 268 KB Output is correct
2 Correct 1246 ms 272 KB Output is correct
3 Correct 1247 ms 268 KB Output is correct
4 Correct 1234 ms 272 KB Output is correct
5 Correct 1229 ms 204 KB Output is correct
6 Correct 1252 ms 204 KB Output is correct
7 Correct 1250 ms 272 KB Output is correct
8 Correct 1279 ms 204 KB Output is correct
9 Correct 1247 ms 272 KB Output is correct
10 Correct 1278 ms 280 KB Output is correct
11 Correct 1282 ms 272 KB Output is correct
12 Correct 1287 ms 204 KB Output is correct
13 Correct 1280 ms 296 KB Output is correct
14 Correct 1256 ms 268 KB Output is correct
15 Correct 1233 ms 268 KB Output is correct
16 Incorrect 1032 ms 276 KB Output isn't correct
17 Halted 0 ms 0 KB -