結果
問題 | No.123 カードシャッフル |
ユーザー |
![]() |
提出日時 | 2015-01-11 23:23:53 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 186 ms / 5,000 ms |
コード長 | 5,372 bytes |
コンパイル時間 | 4,551 ms |
コンパイル使用メモリ | 94,412 KB |
実行使用メモリ | 60,896 KB |
最終ジャッジ日時 | 2024-06-13 04:09:03 |
合計ジャッジ時間 | 6,568 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 10 |
ソースコード
import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.FileInputStream;import java.io.FileNotFoundException;import java.io.FileWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.PrintWriter;import java.util.ArrayList;import java.util.Comparator;import java.util.LinkedList;import java.util.List;import java.util.Queue;import java.util.TreeSet;public class Main {public static int m;public static int n;public static char[][] maze;public static final String laser = "<>^v";public static final String wall = "<>^v#";public static int sx;public static int sy;public static int gx;public static int gy;public static int[][][] dp;public static void main(String[] args) throws NumberFormatException, IOException{ContestScanner in = new ContestScanner();List<Integer> card = new ArrayList<Integer>();int n = in.nextInt();int m = in.nextInt();for(int i=0; i<n; i++){card.add(i+1);}for(int i=0; i<m; i++){int a = in.nextInt()-1;int c = card.remove(a);card.add(0, c);}System.out.println(card.get(0));}}class MyComp implements Comparator<int[]>{public int compare(int[] a, int[] b) {return a[0] - b[0];}}class Reverse implements Comparator<Integer>{public int compare(Integer arg0, Integer arg1) {return arg1 - arg0;}}class Node{int id;List<Node> edge = new ArrayList<Node>();public Node(int id){this.id = id;}public void createEdge(Node node){edge.add(node);}}class NodeW{int id;List<NodeW> edge = new ArrayList<NodeW>();List<Integer> costList = new ArrayList<Integer>();public NodeW(int id) {this.id = id;}public void createEdge(NodeW node, int cost) {edge.add(node);costList.add(cost);}}class Range<T extends Comparable<T>> implements Comparable<Range<T>>{T start;T end;public Range(T start, T end){this.start = start;this.end = end;}public boolean inRange(T val){if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){return true;}return false;}public boolean isCommon(Range<T> range){if(inRange(range.start) || inRange(range.end) || range.inRange(start)){return true;}return false;}public Range<T> connect(Range<T> range){if(!isCommon(range)) return null;Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,end.compareTo(range.end) >= 0 ? end : range.end);return res;}public boolean connectToThis(Range<T> range){if(!isCommon(range)) return false;start = start.compareTo(range.start) <= 0 ? start : range.start;end = end.compareTo(range.end) >= 0 ? end : range.end;return true;}@Overridepublic int compareTo(Range<T> range) {int res = start.compareTo(range.start);if(res == 0) return end.compareTo(range.end);return res;}public String toString(){return "["+start+","+end+"]";}}class RangeSet<T extends Comparable<T>>{TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();public void add(Range<T> range){Range<T> con = ranges.floor(range);if(con != null){if(con.connectToThis(range))range = con;}con = ranges.ceiling(range);while(con != null && range.connectToThis(con)){ranges.remove(con);con = ranges.ceiling(range);}ranges.add(range);}public String toString(){StringBuilder bld = new StringBuilder();for(Range<T> r: ranges){bld.append(r+"\n");}return bld.toString();}}class MyMath{public final static double PIhalf = Math.PI/2.0;public static double pAngle(double x, double y){// ベクトル(1, 0)と(x, y)とのなす角を返す(rad:0 to 2pi)if(x == 0){if(y == 0){System.err.println("pAngle error: zero vector.");return 0;}else if(y < 0){return PIhalf*3.0;}else{return PIhalf;}}double rad = Math.atan(y/x);if(rad < 0){rad += Math.PI*2.0;}return rad;}public static long fact(long n){long res = 1;while(n > 0){res *= n--;}return res;}public static long[][] pascalT(int n){long[][] tri = new long[n][];for(int i=0; i<n; i++){tri[i] = new long[i+1];for(int j=0; j<i+1; j++){if(j == 0 || j == i){tri[i][j] = 1;}else{tri[i][j] = tri[i-1][j-1] + tri[i-1][j];}}}return tri;}// 最大公約数static int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}// 最小公倍数static int lcm(int a, int b){return a * b / gcd(a, b);}}class ContestScanner{private BufferedReader reader;private String[] line;private int idx;public ContestScanner() throws FileNotFoundException{reader = new BufferedReader(new InputStreamReader(System.in));}public ContestScanner(String filename) throws FileNotFoundException{reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}public String nextToken() throws IOException{if(line == null || line.length <= idx){line = reader.readLine().trim().split(" ");idx = 0;}return line[idx++];}public long nextLong() throws IOException, NumberFormatException{return Long.parseLong(nextToken());}public int nextInt() throws NumberFormatException, IOException{return (int)nextLong();}public double nextDouble() throws NumberFormatException, IOException{return Double.parseDouble(nextToken());}}