μΌ | μ | ν | μ | λͺ© | κΈ | ν |
---|---|---|---|---|---|---|
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
- νλ‘κ·Έλλ¨Έμ€
- few shot dst
- Few Shot Dialogue State Tracking using Meta-learning
- dialogue state tracking
- λ°±μ€
- til
- SUMBT:Slot-Utterance Matching for Universal and Scalable Belief Tracking
- νμ΄μ¬μ νμ΄μ¬λ΅κ²
- κ²μμμ§
- μ 보μ²λ¦¬κΈ°μ¬μ 곡μ
- nlpλ Όλ¬Έλ¦¬λ·°
- μ 보μ²λ¦¬κΈ°μ¬μ 곡μν©κ²©νκΈ°
- fasttext text classification νκΈ
- Leveraging Slot Descriptions for Zero-Shot Cross-Domain Dialogue State Tracking
- How Much Knowledge Can You Pack Into the Parameters of a Language Model?
- MySQL
- From Machine Reading Comprehension to Dialogue State Tracking: Bridging the Gap
- λͺ¨λμλ₯λ¬λ
- 2020μ 보μ²λ¦¬κΈ°μ¬νκΈ°
- λ°μ΄ν° ν©μ±
- μ 보μ²λ¦¬κΈ°μ¬ μ± μΆμ²
- Zero-shot transfer learning with synthesized data for multi-domain dialogue state tracking
- λ₯λ¬λκΈ°μ΄
- λ€μ΄λλ―Ή νλ‘κ·Έλλ°
- DST zeroshot learning
- μμ°μ΄μ²λ¦¬ λ Όλ¬Έ 리뷰
- μ 보μ²λ¦¬κΈ°μ¬ μμ λΉ
- classification text
- DST fewshot learning
- Python
Archives
- Today
- Total
π²μλΌλλμ²λ
μλ°μμ sort νκΈ° λ³Έλ¬Έ
λ°μν
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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 | package ch5; //κ΅μ΄ μ μκ° κ°μνλ μμλ‘ //κ΅μ΄ μ μκ° κ°μΌλ©΄ μμ΄ μ μκ° μ¦κ°νλ μμλ‘ //κ΅μ΄ μ μμ μμ΄ μ μκ° κ°μΌλ©΄ μν μ μκ° κ°μνλ μμλ‘ //λͺ¨λ μ μκ° κ°μΌλ©΄ μ΄λ¦μ΄ μ¬μ μμΌλ‘ μ¦κ°νλ μμλ‘ (λ¨, μμ€ν€ μ½λμμ λλ¬Έμλ μλ¬Έμλ³΄λ€ μμΌλ―λ‘ μ¬μ μμΌλ‘ μμ μ¨λ€.) //μ΄λ¦ κ΅μ΄ μμ΄ μνμΌλ‘ λ°μ΄ν°κ° λ€μ΄μ¨λ€. import java.util.Arrays; import java.util.Comparator; import java.util.Scanner; public class Q10825 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); int num = scan.nextInt(); String[][] arr = new String[num][4]; for(int i=0; i<num; i++) { arr[i][0]=scan.next(); arr[i][1]=scan.next(); arr[i][2]=scan.next(); arr[i][3]=scan.next(); } Arrays.sort(arr, new Comparator<String[]>() { @Override public int compare(String[]s1, String[] s2) { int k1 = Integer.parseInt(s1[1]); int k2 = Integer.parseInt(s2[1]); int e1 = Integer.parseInt(s1[2]); int e2 = Integer.parseInt(s2[2]); int m1 = Integer.parseInt(s1[3]); int m2 = Integer.parseInt(s2[3]); if(k1==k2) { if(e1==e2) { if(m1==m2) { return s1[0].compareTo(s2[0]);//μ΄λ¦ μ¬μ μ }else { return Integer.compare(m2, m1);//μν μ μκ° κ°μνλ μμ } }else { return Integer.compare(e1, e2);//μμ¬μ μ μ¦κ°νλ μ } }else { return Integer.compare(k2, k1);//κ΅μ΄ μ μκ° κ°μνλ μμ } } }); for(int i=0; i<num; i++) { System.out.println(arr[i][0]); } } } | cs |
λ°μν
'μκ³ λ¦¬μ¦ λ¬Έμ νμ΄' μΉ΄ν κ³ λ¦¬μ λ€λ₯Έ κΈ
array listμ Dfs, bfs(java) (0) | 2019.04.02 |
---|---|
array listλ‘ κ΅¬νν graph (0) | 2019.04.02 |
μΈμ arrayλ‘ κ·Έλν ꡬν(μλ°) (0) | 2019.04.02 |
Q4344 νκ· μ λκ² μ§ (0) | 2019.03.26 |
λ°±μ€ μλ° Q1309 λλ¬Όμ (0) | 2019.03.19 |