답안 #569243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
569243	2022-05-27T06:26:19 Z	niloyroot	도로 폐쇄 (APIO21_roads)	C++14	5 / 100	58 ms	5672 KB

roads

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1000000007;

vi minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W){
    vi ans;
    ll sum=0;

    for(auto u:W){
        sum+=u;
    }

    sort(W.rbegin(), W.rend());

    for(auto u:W){
        ans.push_back(sum);
        sum-=u;
    }

    ans.push_back(0);

    return ans;
}   

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	1 ms	436 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	2 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	31 ms	2888 KB	Output is correct
13	Correct	38 ms	4692 KB	Output is correct
14	Correct	47 ms	5060 KB	Output is correct
15	Correct	58 ms	5412 KB	Output is correct
16	Correct	52 ms	5540 KB	Output is correct
17	Correct	50 ms	5672 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	38 ms	4464 KB	Output is correct

Subtask #2

0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Incorrect	44 ms	3576 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #3

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Incorrect	1 ms	300 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Incorrect	1 ms	300 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	47 ms	3992 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	47 ms	3992 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	1 ms	436 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	2 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	31 ms	2888 KB	Output is correct
13	Correct	38 ms	4692 KB	Output is correct
14	Correct	47 ms	5060 KB	Output is correct
15	Correct	58 ms	5412 KB	Output is correct
16	Correct	52 ms	5540 KB	Output is correct
17	Correct	50 ms	5672 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	38 ms	4464 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Incorrect	44 ms	3576 KB	Output isn't correct
22	Halted	0 ms	0 KB	-