fork download 
  1. /* package whatever; // don't place package name! */
  2.  
  3. import java.util.*;
  4. import java.lang.*;
  5. import java.io.*;
  6. import java.math.*;
  7.  
  8. /* Name of the class has to be "Main" only if the class is public. */
  9. class Main
  10. {
  11.    public static void main (String[] args) throws java.lang.Exception
  12.    {
  13.        new Main().run();
  14.    }
  15.  
  16.    StreamTokenizer st;
  17.  
  18.    class Item implements Comparable<Item> {
  19.        int x;
  20.        int ind;
  21.        Item(int x, int ind) {
  22.            this.x = x;
  23.            this.ind = ind;
  24.        }
  25.  
  26.        public int compareTo(Item o) {
  27.            if (x < o.x)
  28.                return -1;
  29.            if (x > o.x)
  30.                return 1;
  31.            return ind - o.ind;
  32.        }
  33.    }
  34.  
  35.    PrintWriter out;
  36.  
  37.    void run() {
  38.        try {
  39.            st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
  40.            out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
  41.            int n = nextInt();
  42.            TreeSet<Item> tree = new TreeSet<Item>();
  43.            int[] a = new int[n];
  44.            for (int i = 0; i < n; i++) {
  45.                a[i] = nextInt();
  46.                tree.add(new Item(a[i], i));
  47.            }
  48.            int m = nextInt();
  49.            for (int i = 0; i < m; i++) {
  50.                int q = nextInt();
  51.                if (q == 1) {
  52.                    int x = nextInt();
  53.                    Item toSearch = new Item(x, -1);
  54.                    Item ceil = tree.ceiling(toSearch);
  55.                    if (ceil == null || ceil.x != x)
  56.                        out.println("Error");
  57.                    else {
  58.                        out.printf("%d\n", ceil.ind + 1);
  59.                    }
  60.                } else {
  61.                    int pos = nextInt() - 1;
  62.                    int x = nextInt();
  63.                    Item toDel = new Item(a[pos], pos);
  64.                    tree.remove(toDel);
  65.                    a[pos] = x;
  66.                    Item toAdd = new Item(a[pos], pos);
  67.                    tree.add(toAdd);
  68.                }
  69.            }
  70.            out.close();
  71.        } catch (Exception e) {
  72.            e.printStackTrace(out);
  73.            out.flush();
  74.            out.close();
  75.            //while (true);
  76.        }
  77.    }
  78.  
  79.    int nextInt() throws Exception {
  80.        st.nextToken();
  81.        return (int) st.nval;
  82.    }
  83.  
  84. }
Success #stdin #stdout 0.08s 380288KB
comments (?)
stdin 
5
1 2 3 4 5
5
1 2
1 5
2 1 7
1 3
1 6
stdout 
2
5
3
Error
https://ideone.com/VeNpoo
language:
Java (HotSpot 12)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!