oj.uz

Submission #947064

# Submission time Handle Problem Language Result Execution time Memory
947064 2024-03-15T12:55:51 Z AkibAzmain Carnival Tickets (IOI20_tickets) C++17
11 / 100
 2 ms 604 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

long long find_maximum(int k, std::vector<std::vector<int>> arr) {
  ll n = arr.size();
  ll m = arr[0].size();
  std::vector<std::vector<int>> ans (n, vector < int > (m, -1));
  ll sum = 0;
  if (k == 1)
    {
      vector < pair < ll, ll > > mn (n), mx (n);
      for (int i = 0; i < n; ++i)
        {
          mn[i] = { arr[i][0], i };
          mx[i] = { arr[i][m - 1], i };
        }
      sort (mn.begin (), mn.end ());
      sort (mx.begin (), mx.end ());
      reverse (mx.begin (), mx.end ());
      int i = 0, j = 0;
      vector < bool > v (n);
      vector < ll > a;
      for (int k = 0; k < n / 2; ++k)
        {
          while (v[mn[i].second]) ++i;
          while (v[mx[j].second]) ++j;
          if (mn[i].second != mx[j].second)
            {
              ans[mn[i].second][0] = 0;
              ans[mx[j].second][m - 1] = 0;
              a.push_back (mn[i].first);
              a.push_back (mx[j].first);
              v[mn[i].second] = v[mx[j].second] = true;
              continue;
            }
          int ii = i + 1;
          int ji = j + 1;
          while (ii < n && v[mn[ii].second]) ++ii;
          while (ji < n && v[mx[ji].second]) ++ji;
          if (ji < n && mx[ji].first - mn[i].first > mx[j].first - mn[ii].first)
            {
              ans[mn[i].second][0] = 0;
              ans[mx[ji].second][m - 1] = 0;
              a.push_back (mn[i].first);
              a.push_back (mx[ji].first);
              v[mn[i].second] = v[mx[ji].second] = true;
            }
          else
            {
              ans[mn[ii].second][0] = 0;
              ans[mx[j].second][m - 1] = 0;
              a.push_back (mn[ii].first);
              a.push_back (mx[j].first);
              v[mn[ii].second] = v[mx[j].second] = true;
            }
        }
      sort (a.begin (), a.end ());
      for (auto &x : a) sum += abs (x - a[n / 2]);
    }
  allocate_tickets(ans);
  return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Contestant returned 2543298744 while correct return value is 2727881086.
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 348 KB Contestant returned 2543298744 while correct return value is 2727881086.
9 Halted 0 ms 0 KB -