제출 #1356386

#제출 시각아이디문제언어결과실행 시간메모리
1356386Zbyszek99Casino (JOI26_casino)C++20
컴파일 에러
0 ms0 KiB
#include "Azzurro.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

vector<vi> Azzurro(int N, int n, string S) 
{
    vector<vi> ans(8,vi(8,0));
    int cnt = 0;
    rep(i,8) rep(j,8) if((i != 0 && j != 7) || j == 0 || i == 7) ans[i][j] = (S[cnt++]=='B');
    vector<pii> pom = {{0,1},{0,2},{0,3},{0,4},{0,5},{0,6},{0,7},{1,7},{2,7},{3,7},{4,7},{5,7},{6,7}};
    forall(it,pom)
    {
        int x = it.ff+2;
        int y = it.ss-2;
        int xor_ = 0;
        while(x <= 7 && y >= 0)
        {
            xor_ ^= ans[x][y];
            x += 2;
            y -= 2;
        }
        ans[it.ff][it.ss] = xor_;
    }
    return ans;
}
#include "Azzurro.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

vector<vi> Azzurro(int N, int n, string S) 
{
    vector<vi> ans(8,vi(8,0));
    int cnt = 0;
    rep(i,8) rep(j,8) if((i != 0 && j != 7) || j == 0 || i == 7) ans[i][j] = (S[cnt++]=='B');
    vector<pii> pom = {{0,1},{0,2},{0,3},{0,4},{0,5},{0,6},{0,7},{1,7},{2,7},{3,7},{4,7},{5,7},{6,7}};
    forall(it,pom)
    {
        int x = it.ff+2;
        int y = it.ss-2;
        int xor_ = 0;
        while(x <= 7 && y >= 0)
        {
            xor_ ^= ans[x][y];
            x += 2;
            y -= 2;
        }
        ans[it.ff][it.ss] = xor_;
    }
    return ans;
}

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

# 2번째 컴파일 단계

/usr/bin/ld: /tmp/ccSwpyJ9.o: in function `main':
grader_bordeaux.cpp:(.text.startup+0x328): undefined reference to `Bordeaux[abi:cxx11](int, int, std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >)'
collect2: error: ld returned 1 exit status