์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 |
Tags
- dialogue state tracking
- ์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌ ์์ ๋น
- ํ์ด์ฌ์ ํ์ด์ฌ๋ต๊ฒ
- Leveraging Slot Descriptions for Zero-Shot Cross-Domain Dialogue State Tracking
- MySQL
- til
- ๋ฐ์ดํฐ ํฉ์ฑ
- ๋ชจ๋์๋ฅ๋ฌ๋
- Few Shot Dialogue State Tracking using Meta-learning
- ๋ฅ๋ฌ๋๊ธฐ์ด
- DST fewshot learning
- SUMBT:Slot-Utterance Matching for Universal and Scalable Belief Tracking
- few shot dst
- ์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌ ์ฑ ์ถ์ฒ
- From Machine Reading Comprehension to Dialogue State Tracking: Bridging the Gap
- nlp๋ ผ๋ฌธ๋ฆฌ๋ทฐ
- ์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌ์ ๊ณต์
- How Much Knowledge Can You Pack Into the Parameters of a Language Model?
- classification text
- ํ๋ก๊ทธ๋๋จธ์ค
- Python
- ๋ค์ด๋๋ฏน ํ๋ก๊ทธ๋๋ฐ
- ์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌ์ ๊ณต์ํฉ๊ฒฉํ๊ธฐ
- ๊ฒ์์์ง
- ๋ฐฑ์ค
- Zero-shot transfer learning with synthesized data for multi-domain dialogue state tracking
- ์์ฐ์ด์ฒ๋ฆฌ ๋ ผ๋ฌธ ๋ฆฌ๋ทฐ
- fasttext text classification ํ๊ธ
- DST zeroshot learning
- 2020์ ๋ณด์ฒ๋ฆฌ๊ธฐ์ฌํ๊ธฐ
Archives
- Today
- Total
๐ฒ์๋ผ๋๋์ฒญ๋
Q9496 ํ ํ๋ก์ ํธ(์๊ฐ์ด๊ณผ๋ก ์คํจ) ๋ณธ๋ฌธ
๋ฐ์ํ
package graph;
import java.util.*;
public class Q9496 {
static int num=0;
static int[] arr;
static int[] visit;
static int sum=0;
static int index=0;
static ArrayList<Integer> al;
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int test = Integer.parseInt(scan.nextLine());
while(test>0) {
test--;
sum=0;
num = Integer.parseInt(scan.nextLine());
arr = new int[num+1];
visit = new int[num+1];
String s = scan.nextLine();
StringTokenizer st = new StringTokenizer(s," ");
for(int i=1; i<=num; i++) {
arr[i] = Integer.parseInt(st.nextToken());
}
for(int i=1;i<=num; i++) {
al = new ArrayList<Integer>();
if(visit[i]==0) find(i);
}
System.out.println(num-sum);
}
}
public static void find(int i) {
visit[i] = 1;
al.add(i);
if(arr[i] == i) {
sum += 1;
return;
}
index = al.indexOf(arr[i]);
if(index!=-1){
int n= al.size()-index;
sum = sum + n;
return;
}
else {
int ni = arr[i];
if(visit[ni]==0) find(ni);
}
}
}
๋ฐ์ํ
'์๊ณ ๋ฆฌ์ฆ ๋ฌธ์ ํ์ด' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
Q1427 ์ํธ์ธ์ฌ์ด๋(java) (0) | 2019.09.15 |
---|---|
Q1026 ๋ณด๋ฌผ(java) (0) | 2019.09.15 |
Q4963 ์ฌ์ ๊ฐ์ JAVA (0) | 2019.05.07 |
Q 2667 ๋จ์ง๋ฒํธ ๋ถ์ด๊ธฐ JAVA (0) | 2019.05.07 |
array list์ Dfs, bfs(java) (0) | 2019.04.02 |