#4238 (Java) No.55 正方形を描くだけの簡単なお仕事です。

• 問題: No.55 正方形を描くだけの簡単なお仕事です。
• ユーザー: threepipes_s
• 提出日時: 2014-11-29 16:06:52
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 92 ms / 5,000 ms
• コード長: 5,550 bytes
• コンパイル時間: 2,868 ms
• コンパイル使用メモリ: 86,092 KB
• 実行使用メモリ: 52,752 KB
• 最終ジャッジ日時: 2024-11-14 13:47:27
• 合計ジャッジ時間: 5,227 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 21

ソースコード

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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.TreeSet;
public class Main {
//  public static int w;
//  public static int k;
//  public static int n;
//  public static int[][] dp;
//  public static int[] r;
//  public static long[] buy;
//  public static List<double[]> list = new ArrayList<double[]>();
//  public static NodeW[] product;
    public static void main(String[] args) throws NumberFormatException, IOException{
        ContestScanner in = new ContestScanner();
        int[][] pos = new int[3][2];
        for(int i=0; i<3; i++){
            pos[i][0] = in.nextInt();
            pos[i][1] = in.nextInt();
        }
        int center = -1;
        boolean ans = false;
        int[][] tmpPos;
        for(int i=0; i<2; i++){
            for(int j=i+1; j<3; j++){
                int k = (i==0 && j==1) ? 2 : (i==0 && j==2) ? 1 : 0;
                tmpPos = new int[2][2];
                tmpPos[0][0] = pos[i][0] - pos[k][0];
                tmpPos[0][1] = pos[i][1] - pos[k][1];
                tmpPos[1][0] = pos[j][0] - pos[k][0];
                tmpPos[1][1] = pos[j][1] - pos[k][1];
                if(tmpPos[0][0]*tmpPos[1][0]+tmpPos[0][1]*tmpPos[1][1] == 0){
                    center = k;
                    if(tmpPos[0][0]*tmpPos[0][0]+tmpPos[0][1]*tmpPos[0][1]
                            - tmpPos[1][0]*tmpPos[1][0]-tmpPos[1][1]*tmpPos[1][1] == 0){
                        ans = true;
                        int x = tmpPos[0][0] + tmpPos[1][0] + pos[k][0];
                        int y = tmpPos[0][1] + tmpPos[1][1] + pos[k][1];
                        System.out.println(x+" "+y);
                    }
                    break;
                }
            }
            if(center >= 0) break;
        }
        if(!ans) System.out.println(-1);
        
    }
    
}
//class MyComp implements Comparator<int[]>{
//  public int compare(int[] a, int[] b) {
//      return Main.product[a[0]].dist - Main.product[b[0]].dist;
//  }
//}
class Reverse implements Comparator<Integer>{
    public int compare(Integer arg0, Integer arg1) {
        return arg1 - arg0;
    }
}
class NodeW{
    int id;
//  int dist;
    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);
//      node.setDist(dist+1);
    }
//  public void setDist(int dist){
//      this.dist = Math.max(this.dist, dist);
//      for(NodeW node: edge){
//          node.setDist(dist+1);
//      }
//  }
}
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;
    }
    @Override
    public 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 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 MyMath{
    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;
    }
}
class ContestScanner{
    private BufferedReader reader;
    private String[] line;
    private int idx;
    public ContestScanner() throws FileNotFoundException{
        reader = new BufferedReader(new InputStreamReader(System.in));
    }
    
    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());
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX