제출 #1035333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1035333		RecursiveCo	9월 (APIO24_september)	C++17	0 / 100	0 ms	348 KiB

september

// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

//#define int long long int

template <typename T, typename I>
struct segtree {
    int n;
    vector<T> tree;
    vector<I> initial;
    T id;

    segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
        tree.resize(4 * n);
    }

    T conquer(T left, T right) {
        // write your conquer function
    }

    T value(I inp) {
        // write your value function
    }

    void build(int v, int l, int r) {
        if (l == r) tree[v] = value(initial[l]);
        else {
            int middle = (l + r) / 2;
            build(2 * v, l, middle);
            build(2 * v + 1, middle + 1, r);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    void upd(int v, int l, int r, int i, I x) {
        if (l == r) tree[v] = value(x);
        else {
            int middle = (l + r) / 2;
            if (middle >= i) upd(2 * v, l, middle, i, x);
            else upd(2 * v + 1, middle + 1, r, i, x);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    T query(int v, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr) return tree[v];
        else if (r < ql || qr < l) return id;
        int middle = (l + r) / 2;
        T left = query(2 * v, l, middle, ql, qr);
        T right = query(2 * v + 1, middle + 1, r, ql, qr);
        return conquer(left, right);
    }
};

// vector<int>

vector<vector<int>> SG;
vector<vector<int>> adjList;
vector<int> maxind;
vector<int> ind;

int dfs(int v) {
    int here = ind[v];
    for (int con: adjList[v]) {
        here = max(here, dfs(con));
    }
    return here;
}

int solve(int n, int m, vector<int> F, vector<vector<int>> S) {
    adjList.clear();
    adjList.resize(n);
    SG.clear();
    SG.resize(m, vector<int>(n - 1));
    maxind.clear();
    maxind.resize(n);
    ind.clear();
    ind.resize(n);
    forto(n - 1, i) ind[S[0][i]] = i;
    forto(m, i) forto(n - 1, j) SG[i][j] = S[i][j];
    forto(n, i) {
        if (i == 0) continue;
        adjList[F[i]].push_back(i);
    }
    int ans = 1;
    int right = 0;
    forto(n - 1, i) {
        if (i > right) {
            ans++;
            right = i;
        }
        right = max(right, maxind[S[0][i]]);
    }
    return ans;
}

/*signed main() {
    improvePerformance;
    //getTest;
    
    //eachTest {
        get(n);
        get(m);
        getList(n, F2);
        vector<vector<int>> S2(m, vector<int>(n - 1));
        forto(m, i) {
            forto(n - 1, j) {
                cin >> S2[i][j];
            }
        }
        out(solve(n, m, F2, S2));
    //}
}*/

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

september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
september.cpp:93:5: note: in expansion of macro 'forto'
   93 |     forto(n - 1, i) ind[S[0][i]] = i;
      |     ^~~~~
september.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
september.cpp:94:5: note: in expansion of macro 'forto'
   94 |     forto(m, i) forto(n - 1, j) SG[i][j] = S[i][j];
      |     ^~~~~
september.cpp:15:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
september.cpp:94:17: note: in expansion of macro 'forto'
   94 |     forto(m, i) forto(n - 1, j) SG[i][j] = S[i][j];
      |                 ^~~~~
september.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
september.cpp:95:5: note: in expansion of macro 'forto'
   95 |     forto(n, i) {
      |     ^~~~~
september.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
september.cpp:101:5: note: in expansion of macro 'forto'
  101 |     forto(n - 1, i) {
      |     ^~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 5
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16