제출 #1107058

#제출 시각아이디문제언어결과실행 시간메모리
1107058Requiem전선 연결 (IOI17_wiring)C++17
0 / 100
1 ms336 KiB
#include "wiring.h" #include<bits/stdc++.h> //#define int long long #define ll long long #define pb push_back #define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); #define MOD 1000000007 #define inf 1e18 #define fi first #define se second #define FOR(i,a,b) for(int i=a;i<=b;i++) #define FORD(i,a,b) for(int i=a;i>=b;i--) #define sz(a) ((int)(a).size()) #define endl '\n' #define pi 3.14159265359 #define TASKNAME "wiring" using namespace std; template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; } template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; } typedef pair<int,int> ii; typedef pair<int,ii> iii; typedef vector<int> vi; const int MAXN = 3e5 + 9; int n, m; vector<int> r, b; ll min_total_length(vector<int> r, vector<int> b){ } //main() //{ // fast; // if (fopen(TASKNAME".inp","r")){ // freopen(TASKNAME".inp","r",stdin); // freopen(TASKNAME".out","w",stdout); // } // cin >> n; // r.resize(n); // FOR(i, 0, n - 1){ // cin >> r[i]; // } // // b.resize(m); // FOR(i, 0, m - 1){ // cin >> b[i]; // } //} /** Warning: Đọc sai đề??? Cận lmao Code imple thiếu case nào không. Limit. **/

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

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:29:1: warning: no return statement in function returning non-void [-Wreturn-type]
   29 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...