제출 #1366227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1366227		opeleklanos	Toy Design (EGOI22_toydesign)	C++20	컴파일 에러	0 ms	0 KiB

Main

#include <iostream>
#include <vector>
using namespace std;


// vector<vector<int>> secret_ans;

// vector<vector<vector<int>>> levels;

// int connected(int lvl, int a, int b){
//     int x=-1, y=-1;
//     for(int i = 0; i<levels[lvl].size(); i++){
//         int count = 0;
//         for(auto j:levels[lvl][i]) if(j == a || j==b) count++;
//         if(count == 0) continue;
//         if(count == 2) return lvl;
//         if(count == 1){
//             if(x == -1) x = i;
//             else y = i;
//         }
//     }

//     levels.push_back(levels[lvl]);
//     for(auto i : levels.back()[y]) levels.back()[x].push_back(i);
//     levels.back()[y].assign(0, 0);
//     return levels.size()-1;
// }

//-----------------------------------------------------------------------------------
int lastLevel = 0;
vector<int> rep;

struct segTree{
    int l; int r;
    int leader;
    segTree * lc, * rc;
    int level;
    segTree(int ind){
        leader = rep[ind];
        l = r = ind;
        level = 0;
        lc = rc = nullptr;
    }

    segTree(segTree*le, segTree*ri){
        lc = le;
        rc = ri;
        l = lc->l;
        r = rc->r;
        leader = lc->leader;
        level = Connected(lc->level, lc->leader, rc->leader);
        lastLevel = level;
    }
};

segTree * build(int l, int r){
    int mid = (l+r)/2;
    if(l==r) return new segTree(l);
    else return new segTree(build(l, mid), build(mid+1, r));
}

int query(segTree * st, int nd){
    if(st->l == st->r) return st->leader;

    if(st->lc->level == Connected(st->lc->level, nd, st->lc->leader)) return query(st->lc, nd);
    else return query(st->rc, nd);
}

void ToyDesign(int n, int max_ops){
    rep.clear();
    rep.push_back(1);
    for(int i = 2; i<=n; i++){
        int b = Connected(lastLevel, 1, i);
        if(b>lastLevel) rep.push_back(i);
        lastLevel = b;
    }

    segTree * seg = build(0, rep.size()-1);

    vector<pair<int, int>> ans;

    int repind = 0;

    for(int i = 1; i<=n; i++){
        if(i == rep[repind]){
            repind++;
            continue;
        }
        ans.push_back({i, query(seg, i)});
    }
    DescribeDesign(ans);
    // for(auto i : ans) cout<<i.first<<' '<<i.second<<endl;
}

// int main(void){
//     freopen("input.txt", "r", stdin);
//     int n1, m1; cin>>n1>>m1;

//     secret_ans.assign(m1, {});

//     for(int i = 0; i<n1; i++){
//         int a, b; cin>>a>>b;
//         secret_ans[a].push_back(b);
//     }

//     levels.push_back(secret_ans);

//     ToyDesign(n1, 10000);
// }

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

Main.cpp: In constructor 'segTree::segTree(segTree*, segTree*)':
Main.cpp:51:17: error: 'Connected' was not declared in this scope
   51 |         level = Connected(lc->level, lc->leader, rc->leader);
      |                 ^~~~~~~~~
Main.cpp: In function 'int query(segTree*, int)':
Main.cpp:65:25: error: 'Connected' was not declared in this scope
   65 |     if(st->lc->level == Connected(st->lc->level, nd, st->lc->leader)) return query(st->lc, nd);
      |                         ^~~~~~~~~
Main.cpp: In function 'void ToyDesign(int, int)':
Main.cpp:73:17: error: 'Connected' was not declared in this scope
   73 |         int b = Connected(lastLevel, 1, i);
      |                 ^~~~~~~~~
Main.cpp:91:5: error: 'DescribeDesign' was not declared in this scope
   91 |     DescribeDesign(ans);
      |     ^~~~~~~~~~~~~~
Main.cpp: In function 'int query(segTree*, int)':
Main.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
   67 | }
      | ^