제출 #566611

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
566611		josanneo22	Road Closures (APIO21_roads)	C++17	컴파일 에러	0 ms	0 KiB

roads

#include "roads.h"

#include <vector>
#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
#define mp make_pair
#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define f first
#define s second
#define out(x) cout<<x<<'\n';
#define in(x) cin>>x;
#define inarr(a,x,y) for(int i=x;i<y;i++){cin>>a[i];}
#define incor(a,x,y) for(int i=x;i<y;i++){cin>>a[i].f>>a[i].s;}

vll minimum_closure_costs(int n, vi u,vi v,vi w) 
{
	sort(all(w));
	vll val(n);
	FOR(i,0,n)
	{
		if(i) val[i]=((ll)w[i]+val[i-1]);
		else val[i]=((ll)w[i]);
	}
	reverse(all(val))
	return val;
}

컴파일 시 표준 에러 (stderr) 메시지

roads.cpp: In function 'vll minimum_closure_costs(int, vi, vi, vi)':
roads.cpp:45:19: error: expected ';' before 'return'
   45 |  reverse(all(val))
      |                   ^
      |                   ;
   46 |  return val;
      |  ~~~~~~            
roads.cpp:47:1: warning: no return statement in function returning non-void [-Wreturn-type]
   47 | }
      | ^