제출 #1141483

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1141483		brianhdzmdo	Coins (IOI17_coins)	C++20	컴파일 에러	0 ms	0 KiB

coins

#include "coins.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <math.h>
#include <string>
#include <set>
#include <utility>
#define all(a) (a).begin(), (a).end()
#define allr(a) (a).rbegin(), (a).rend()
#define ll long long
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define fr1(i, a, b) for (ll i = a - 1; i >= b; i--)
#define fi first
#define se second
#define mp(j, k) make_pair(j, k)
#define pb(x) push_back(x)
#define pbp(x, y) push_back({x, y})
#define in(x) insert(x)
#define vec vector<ll>
#define vecv vector<vector<ll> >
#define veb vector<bool>
#define vecp vector<pair<ll,ll>>
#define yes cout << "YES\n";
#define no cout << "NO\n";
#define ac 1e-7
#define fauto(a)   \
  for (auto i : a) \
    cout << i << " ";
#define fautop(a)  \
  for (auto i : a) \
    cout << i.fi << " " << i.se << endl;

using namespace std;

ll find_coin(vec b)
{
    ll one = 0, zero = 0;
    ll pos_o = -1, pos_z = -1;

    fr(i, 0, 3)
    {
        if(b[i]){
            one++;
            pos_o = i;
        }
        else
        {
            zero++;
            pos_z = i;
        }
    }

    if(one == 1)
    {
        return pos_o;
    }
    else
    return pos_z;
}

vec coin_flips(vec b, ll c)
{
    if(c == 1)
    {
        if(b[c] == b[c - 1] && b[c] == b[c + 1])
        {
            b[c] -= b[c] - 1;
        }
        else if(b[c] == b[c -1] && b[c] != b[c + 1])
        {
            b[c - 1] -= b[c - 1] - 1;
        }
        else if(b[c] != b[c - 1] && b[c] == b[c + 1])
        {
            b[c + 1] -= b[c + 1] - 1;
        }
    }
    else if(c == 0)
    {
        if(b[c] == b[c + 1] && b[c] == b[c + 2])
        {
            b[c] -= b[c] - 1;
        }
        else if(b[c] == b[c + 1] && b[c] != b[c + 2])
        {
            b[c + 1] -= b[c + 1] - 1;
        }
        else if(b[c] != b[c + 1] && b[c] == b[c + 2])
        {
            b[c + 2] -= b[c + 2] - 1;
        }
    }
    else if(c == 2)
    {
        if(b[c] == b[c - 1] && b[c] == b[c - 2])
        {
            b[c] -= b[c] - 1;
        }
        else if(b[c] == b[c - 1] && b[c] != b[c - 2])
        {
            b[c - 1] -= b[c - 1] - 1;
        }
        else if(b[c] != b[c - 1] && b[c] == b[c - 2])
        {
            b[c - 2] -= b[c - 2] - 1;
        } 
    }

    find_coin(b);
}

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

coins.cpp: In function 'std::vector<long long int> coin_flips(std::vector<long long int>, long long int)':
coins.cpp:113:1: warning: no return statement in function returning non-void [-Wreturn-type]
  113 | }
      | ^
/usr/bin/ld: /tmp/ccBVev5t.o: in function `main':
grader.cpp:(.text.startup+0x3e2): undefined reference to `coin_flips(std::vector<int, std::allocator<int> >, int)'
/usr/bin/ld: grader.cpp:(.text.startup+0xb8a): undefined reference to `find_coin(std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status