Submission #596694
Source Code Expand
#include <cstdio> #include <string> #include <cmath> #include <cstring> #include <vector> #include <map> #include <iostream> #include <algorithm> using namespace std; const int N = 100000 + 10; const int MOD = (int)1e9 + 7; int n; int x[N], y[N]; map<pair<int, int>, int> vec; void solve() { cin >> n; for(int i = 0; i < n; ++ i) { cin >> x[i] >> y[i]; vec[make_pair(x[i], y[i])] = i; } for(int i = 0; i < n; ++ i) { for(int j = i + 1; j < n; ++ j) { int vy = x[i] - x[j]; int vx = y[j] - y[i]; for(int k = 0; k < 2; ++ k) { if (vec.count(make_pair(x[i] + vx, y[i] + vy)) && vec.count(make_pair(x[j] + vx, y[j] + vy))) { cout << 4 << endl; vector<int> ids; ids.push_back(i + 1); ids.push_back(j + 1); ids.push_back(vec[make_pair(x[i] + vx, y[i] + vy)] + 1); ids.push_back(vec[make_pair(x[j] + vx, y[j] + vy)] + 1); sort(ids.begin(), ids.end()); for(int w = 0; w < 4; ++ w) { cout << ids[w] << endl; } return; } vx = -vx; vy = -vy; } } } cout << 0 << endl; } int main() { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Regular Polygon |
User | AngryBacon |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1153 Byte |
Status | AC |
Exec Time | 101 ms |
Memory | 1060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_special01.txt, subtask1_special02.txt, subtask1_special03.txt, subtask1_special04.txt, subtask1_special05.txt, subtask1_special06.txt, subtask1_special07.txt, subtask1_special08.txt, subtask1_special09.txt, subtask1_special10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 26 ms | 940 KB |
subtask0_sample_02.txt | AC | 25 ms | 940 KB |
subtask1_random01.txt | AC | 99 ms | 1052 KB |
subtask1_random02.txt | AC | 101 ms | 1040 KB |
subtask1_random03.txt | AC | 97 ms | 1052 KB |
subtask1_random04.txt | AC | 99 ms | 1044 KB |
subtask1_random05.txt | AC | 29 ms | 1048 KB |
subtask1_random06.txt | AC | 33 ms | 1048 KB |
subtask1_random07.txt | AC | 100 ms | 1048 KB |
subtask1_random08.txt | AC | 99 ms | 1048 KB |
subtask1_special01.txt | AC | 25 ms | 1052 KB |
subtask1_special02.txt | AC | 24 ms | 1044 KB |
subtask1_special03.txt | AC | 28 ms | 1040 KB |
subtask1_special04.txt | AC | 25 ms | 1044 KB |
subtask1_special05.txt | AC | 90 ms | 1044 KB |
subtask1_special06.txt | AC | 42 ms | 1044 KB |
subtask1_special07.txt | AC | 38 ms | 1052 KB |
subtask1_special08.txt | AC | 44 ms | 1060 KB |
subtask1_special09.txt | AC | 48 ms | 1044 KB |
subtask1_special10.txt | AC | 26 ms | 1044 KB |