Submission #573504
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define f first
#define s second
map<pair<int, int>, int> m;
int n;
int ans[4];
pair<int, int> p[1111];
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
{
scanf("%d%d", &p[i].f, &p[i].s);
m[p[i]] = i;
}
int flag = 0;
for(int i = 1; i = n; i++)
{
for(int j = 1; j <= n; j++)
{
if(i == j) continue;
pair<int, int> vec1 = mp(p[j].f - p[i].f, p[j].s - p[i].s), vec2 = mp(p[i].f - p[j].f, p[i].s - p[j].s);
if(m[mp(p[i].f - vec1.s, p[i].s + vec1.f)] && m[mp(p[j].f + vec2.s, p[j].s - vec2.f)])
{
ans[0] = m[mp(p[i].f - vec1.s, p[i].s + vec1.f)];
ans[1] = m[mp(p[j].f + vec2.s, p[j].s - vec2.f)];
ans[2] = i, ans[3] = j;
sort(ans, ans + 4);
printf("4\n");
for(int k = 0; k < 4; k++) printf("%d\n", ans[k]);
flag = 1;
}
if(flag) break;
if(m[mp(p[j].f - vec1.s, p[j].s + vec1.f)] && m[mp(p[i].f + vec2.s, p[i].s - vec2.f)])
{
ans[0] = m[mp(p[j].f - vec1.s, p[j].s + vec1.f)];
ans[1] = m[mp(p[i].f + vec2.s, p[i].s - vec2.f)];
ans[2] = i, ans[3] = j;
sort(ans, ans + 4);
printf("4\n");
for(int k = 0; k < 4; k++) printf("%d\n", ans[k]);
flag = 1;
}
if(flag) break;
}
if(flag) break;
}
if(!flag) puts("0");
return 0;
}
Submission Info
Submission Time
2015-11-18 20:33:58+0900
Task
C - Regular Polygon
User
gorodan
Language
C++ (G++ 4.6.4)
Score
0
Code Size
1457 Byte
Status
TLE
Exec Time
2040 ms
Memory
1188 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:18:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
31 ms
872 KB
subtask0_sample_02.txt
TLE
2034 ms
996 KB
subtask1_random01.txt
TLE
2035 ms
1120 KB
subtask1_random02.txt
TLE
2034 ms
1188 KB
subtask1_random03.txt
TLE
2034 ms
1128 KB
subtask1_random04.txt
TLE
2034 ms
1124 KB
subtask1_random05.txt
TLE
2032 ms
1128 KB
subtask1_random06.txt
TLE
2040 ms
1064 KB
subtask1_random07.txt
TLE
2035 ms
1128 KB
subtask1_random08.txt
TLE
2036 ms
1132 KB
subtask1_special01.txt
TLE
2036 ms
1004 KB
subtask1_special02.txt
TLE
2034 ms
1000 KB
subtask1_special03.txt
TLE
2034 ms
880 KB
subtask1_special04.txt
AC
26 ms
876 KB
subtask1_special05.txt
TLE
2033 ms
1132 KB
subtask1_special06.txt
TLE
2034 ms
1128 KB
subtask1_special07.txt
TLE
2036 ms
984 KB
subtask1_special08.txt
TLE
2038 ms
1060 KB
subtask1_special09.txt
TLE
2036 ms
1128 KB
subtask1_special10.txt
AC
27 ms
916 KB