oj.uz

답안 #901528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901528 2024-01-09T14:09:48 Z ngano_upat_na A Plus B (IOI23_aplusb) C++17
10 / 100
 1 ms 348 KB 
#include "bits/stdc++.h"
#include "aplusb.h"
using namespace std;

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
    vector<int> ans;
    ans.push_back(A[0] + B[0]);
    int x = 0, y = 0;
    for (int i=0; i<N-1; i++) {
        ans.push_back(min(A[x+1]+B[y],A[x]+B[y+1]));
        if (ans[i+1] == A[x+1]+B[y]) {
            x++;
        }   
        else {
            y++;
        }   
    }
    return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 4th token, expected: '30', found: '32'
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 4th token, expected: '30', found: '32'
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 4th token, expected: '30', found: '32'
8 Halted 0 ms 0 KB -