oj.uz

답안 #1065724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065724 2024-08-19T11:17:24 Z Gr1sen 봉쇄 시간 (IOI23_closing) C++17
8 / 100
 73 ms 25424 KB 
#include "closing.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;


#define ll long long
#define vi vector<ll>
#define mp make_pair
#define pi pair<ll,ll>
#define pq priority_queue<pi>
#define vvi vector<vi>
#define vp vector<pi>
#define vvp vector<vp>
#define F first
#define S second

vi M;
vvp Adj;

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    M = vi(N, -1);
    Adj = vvp(N);
    for (int i = 0; i < V.size(); i++) {
        int a  = U[i];
        int b  = V[i];
        int c  = -W[i];
        Adj[a].push_back({b, c});
        Adj[b].push_back({a, c});
    }
    pq Q;
    Q.push({0, X});
    Q.push({0, Y});
    ll ans = 0;
    while (Q.size()) {
    	int a = Q.top().second;
        int b = Q.top().first * (-1);
        Q.pop();
        //cerr << a << " " << b << endl;
        if (M[a] != -1) continue;
        if (K - b < 0) return ans;
        M[a] = b;
        ans += 1;
        K -= b;
        for (auto i : Adj[a]) {
            Q.push({i.S - b, i.F});
        }
    }
    return ans;
}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int i = 0; i < V.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 21584 KB Output is correct
2 Correct 64 ms 25424 KB Output is correct
3 Correct 42 ms 5456 KB Output is correct

Subtask #2
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -