-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathE.java
151 lines (147 loc) · 4.59 KB
/
E.java
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
import java.util.*;
import java.io.*;
public class Candy {
public static void main(String [] args) {
Solver s = new Solver () ;
s.solve();
}
static class Solver {
int min_value(ArrayList <Pair> a) {
int mn = Integer.MAX_VALUE;
for(Pair i : a) {
mn = Math.min(mn, i.first);
}
return mn;
}
void solve() {
Reader in = new Reader ();
Writer out = new Writer ();
int n = in.nextInt();
Pair [] a = new Pair [n + 1];
for(int i = 1; i <= n; i++) {
a[i] = new Pair();
a[i].first = in.nextInt();
a[i].second = i;
}
Arrays.sort(a, 1, n + 1, new Pair());
if(a[n - 1].first == 0) {
System.out.println("-1");
System.exit(0);
}
ArrayList <Pair> ans = new ArrayList <> ();
ArrayList <Pair> can = new ArrayList <> ();
can.add(a[n]);
can.add(a[n - 1]);
for(int i = n - 2; i >= 1; i--) {
ArrayList <Pair> cur = new ArrayList <> ();
cur.add(a[i]);
cur.add(can.get(0));
cur.add(can.get(1));
Collections.sort(cur, new Pair());
while(min_value(cur) > 0) {
int q = cur.get(1).first / cur.get(0).first;
for(int b = 0; b < 30; b++) {
if((1 << b) > q) break;
if(((q >> b) & 1) == 1) {
cur.get(1).first -= cur.get(0).first;
cur.get(0).first <<= 1;
ans.add(new Pair(cur.get(0).second, cur.get(1).second));
} else {
cur.get(2).first -= cur.get(0).first;
cur.get(0).first <<= 1;
ans.add(new Pair(cur.get(0).second, cur.get(2).second));
}
}
Collections.sort(cur, new Pair());
}
can.clear();
for(Pair x : cur) {
if(x.first != 0) {
can.add(x);
}
}
}
System.out.println(ans.size());
for(Pair i : ans) {
System.out.println(i.first + " " + i.second);
}
}
}
static class Reader {
private StringTokenizer a;
private BufferedReader b;
Reader () {
a = null;
b = new BufferedReader (new InputStreamReader (System.in));
}
public String next () {
while(a == null || !a.hasMoreTokens()) {
try {
a = new StringTokenizer (b.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return a.nextToken();
}
public int nextInt() {
return Integer.parseInt(this.next());
}
public long nextLong () {
return Long.parseLong(this.next());
}
public double nextDouble () {
return Double.parseDouble(this.next());
}
public String nextLine() {
try {
return b.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return "";
}
}
static class Writer {
private PrintWriter a;
private StringBuffer b;
Writer () {
a = new PrintWriter (System.out);
b = new StringBuffer ("");
}
public void write (Object s) {
b.append(s);
}
public void writeln(Object s) {
b.append(s).append('\n');
}
public void flush () {
a.print(b);
a.flush();
a.close();
}
}
static class Pair implements Comparator <Pair> {
int first;
int second;
Pair (int a, int b) {
this.first = a;
this.second = b;
}
Pair (Pair a) {
this.first = a.first;
this.second = a.second;
}
Pair () {}
public String toString () {
return "[" + first + ", " + second + "]";
}
public int compare (Pair a, Pair b) {
if(a.first == b.first) {
return a.second - b.second;
} else {
return a.first - b.first;
}
}
}
}