From 1c1816a4037f3e1c3689406d27e1bcf710257f87 Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Tue, 11 Mar 2025 17:21:10 +0900
Subject: [PATCH] =?UTF-8?q?[20250311]=20BOJ=20/=20P3=20/=20=EB=B9=B5=20?=
 =?UTF-8?q?=EC=A0=95=EB=A0=AC=20/=20=EA=B6=8C=ED=98=81=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ... \353\271\265 \354\240\225\353\240\254.md" | 102 ++++++++++++++++++
 1 file changed, 102 insertions(+)
 create mode 100644 "khj20006/202503/11 BOJ P3 \353\271\265 \354\240\225\353\240\254.md"

diff --git "a/khj20006/202503/11 BOJ P3 \353\271\265 \354\240\225\353\240\254.md" "b/khj20006/202503/11 BOJ P3 \353\271\265 \354\240\225\353\240\254.md"
new file mode 100644
index 00000000..01207145
--- /dev/null
+++ "b/khj20006/202503/11 BOJ P3 \353\271\265 \354\240\225\353\240\254.md"	
@@ -0,0 +1,102 @@
+```java
+
+import java.util.*;
+import java.io.*;
+
+class SegTree{
+	int[] tree;
+	SegTree(int size){
+		tree = new int[size*4 + 1];
+	}
+	void upt(int s, int e, int i, int n) {
+		if(s == e) {
+			tree[n]++;
+			return;
+		}
+		int m=(s+e)>>1;
+		if(i<=m) upt(s,m,i,n*2);
+		else upt(m+1,e,i,n*2+1);
+		tree[n] = tree[n*2] + tree[n*2+1];
+	}
+	int find(int s, int e, int l, int r, int n) {
+		if(l>r || l>e || r<s) return 0;
+		if(l<=s && e<=r) return tree[n];
+		int m=(s+e)>>1;
+		return find(s,m,l,r,n*2) + find(m+1,e,l,r,n*2+1);
+	}
+}
+
+class Main {
+	
+	// IO field
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+
+	static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+	static int nextInt() {return Integer.parseInt(st.nextToken());}
+	static long nextLong() {return Long.parseLong(st.nextToken());}
+	static void bwEnd() throws Exception {bw.flush();bw.close();}
+	
+	// Additional field
+	
+	static int N;
+	static int[] A, pos;
+	static boolean[] vis;
+	static SegTree seg;
+	
+	public static void main(String[] args) throws Exception {
+			
+		ready();
+		solve();
+	
+		bwEnd();
+		
+	}
+	
+	static void ready() throws Exception{
+		
+		N = Integer.parseInt(br.readLine());
+		A = new int[N+1];
+		pos = new int[N+1];
+		vis = new boolean[N+1];
+		seg = new SegTree(N);
+		
+		nextLine();
+		for(int i=1;i<=N;i++) {
+			int a = nextInt();
+			A[i] = a;
+			pos[a] = i;
+		}
+		
+	}
+	
+	static void solve() throws Exception{
+		
+		int s = 1, e = 2;
+		nextLine();
+		for(int i=1;i<=N-2;i++) {
+			int b = nextInt();
+			int p = pos[b] - seg.find(1, N, 1, pos[b], 1);
+			vis[b] = true;
+			while(vis[A[s]]) s++;
+			while(vis[A[e]] || s >= e) e++;
+			seg.upt(1, N, pos[b], 1);
+			if(p%2 != 0) continue;
+			int temp = pos[A[s]];
+			pos[A[s]] = pos[A[e]];
+			pos[A[e]] = temp;
+			temp = A[s];
+			A[s] = A[e];
+			A[e] = temp;
+		}
+		
+		int p = nextInt(), q = nextInt();
+		if(p == A[s] && q == A[e]) bw.write("Possible");
+		else bw.write("Impossible");
+		
+	}
+	
+}
+
+```