oj.uz

Submission #963410

# Submission time Handle Problem Language Result Execution time Memory
963410 2024-04-15T01:15:29 Z rxlfd314 A Plus B (IOI23_aplusb) C++17
10 / 100
 1 ms 348 KB 
#include "aplusb.h"
#include <bits/stdc++.h>
using namespace std;
using ari2 = array<int, 2>;
using ari3 = array<int, 3>;

#define vt vector
#define size(x) (int((x).size()))
#define all(x) begin(x), end(x)

#define REP(a,b,c,d) for(int a=(b);(d)>0?a<=(c):a>=(c);a+=(d))
#define FOR(a,b,c) REP(a,b,c,1)
#define ROF(a,b,c) REP(a,b,c,-1)

vt<int> smallest_sums(int N, vt<int> A, vt<int> B) {
  map<ari2, bool> seen;
  priority_queue<ari3, vt<ari3>, greater<ari3>> pq;
  pq.push({A[0]+B[0], 0, 0});
  vt<int> ans;
  seen[{0, 0}] = true;
  while (size(pq)) {
    auto [s, i, j] = pq.top();
    pq.pop();
    if (size(ans) == N)
      break;
    ans.push_back(s);
    if (i+1 < N && !seen[{i+1, j}])
      pq.push({A[i+1]+B[j], i+1, j});
    if (j+1 < N && !seen[{i, j+1}])
      pq.push({A[i]+B[j+1], i, j+1});
  }
  return ans;
}

Subtask #1
10.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 344 KB Output is correct

Subtask #2
0.0 / 20.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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 6th token, expected: '32', found: '31'
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 6th token, expected: '32', found: '31'
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 6th token, expected: '32', found: '31'
8 Halted 0 ms 0 KB -