Submission #14068861

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     @hamayanhamayan0
　　　　／　　　＼　 　  |　|
　　　 /　　 /￣￣￣￣/　　|
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
　 　　　＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/













int N, Q;
struct Node {
	Node(int v) : val(v), next(nullptr) {}
	Node* next;
	int val;
};
Node* containers[201010];
Node* topOfDesk[201010];
int ans[201010];
//---------------------------------------------------------------------------------------------------
void out() {
	rep(desk, 1, N + 1) {
		Node* cur = topOfDesk[desk];
		while (cur != nullptr) {
			ans[cur->val] = desk;
			cur = cur->next;
		}
	}
	rep(container, 1, N + 1) printf("%d\n", ans[container]);
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> Q;

	rep(i, 1, N + 1) topOfDesk[i] = containers[i] = new Node(i);
	rep(_, 0, Q) {
		int f, t, x; cin >> f >> t >> x;

		Node* nextTop = topOfDesk[f];
		topOfDesk[f] = containers[x]->next;
		containers[x]->next = topOfDesk[t];
		topOfDesk[t] = nextTop;
	}

	out();
}

Submission Info

Compile Error

./Main.cpp: In constructor ‘Node::Node(int)’:
./Main.cpp:38:6: warning: ‘Node::val’ will be initialized after [-Wreorder]
   38 |  int val;
      |      ^~~
./Main.cpp:37:8: warning:   ‘Node* Node::next’ [-Wreorder]
   37 |  Node* next;
      |        ^~~~
./Main.cpp:36:2: warning:   when initialized here [-Wreorder]
   36 |  Node(int v) : val(v), next(nullptr) {}
      |  ^~~~

Judge Result