Submission #226894

#	Time	Username	Problem	Language	Result	Execution time	Memory
226894		PedroBigMan	전선 연결 (IOI17_wiring)	C++14	13 / 100	44 ms	1916 KiB

wiring

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include "wiring.h"
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll)a; i<(ll)b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 100000000000000000LL
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

ll min_total_length(vector<int> r, vector<int> b) 
{
    ll ans=0LL; 
    REP(i,0,b.size()) {ans+=(ll) b[i];}
    REP(i,0,r.size()) {ans-=(ll) r[i];}
    if(r.size()<=b.size()) 
    {
        REP(i,0,b.size()-r.size()) {ans-=r[r.size()-1];}
    }
    else 
    {
        REP(i,0,r.size()-b.size()) {ans+=b[0];}
    }
    return ans;
}

Compilation message (stderr)

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:18:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=(ll)a; i<(ll)b; i++)
wiring.cpp:38:13:
         REP(i,0,b.size()-r.size()) {ans-=r[r.size()-1];}
             ~~~~~~~~~~~~~~~~~~~~~    
wiring.cpp:38:9: note: in expansion of macro 'REP'
         REP(i,0,b.size()-r.size()) {ans-=r[r.size()-1];}
         ^~~
wiring.cpp:18:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=(ll)a; i<(ll)b; i++)
wiring.cpp:42:13:
         REP(i,0,r.size()-b.size()) {ans+=b[0];}
             ~~~~~~~~~~~~~~~~~~~~~    
wiring.cpp:42:9: note: in expansion of macro 'REP'
         REP(i,0,r.size()-b.size()) {ans+=b[0];}
         ^~~

• Subtask 1: 0 / 7
• Subtask 2: 13 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45