| Task: | dobri |
| Sender: | Kuha |
| Submission time: | 2016-08-02 15:21:50 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 100 |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | details |
| #2 | ACCEPTED | 0.05 s | details |
| #3 | ACCEPTED | 0.06 s | details |
| #4 | ACCEPTED | 0.05 s | details |
| #5 | ACCEPTED | 0.06 s | details |
| #6 | ACCEPTED | 0.06 s | details |
| #7 | ACCEPTED | 0.06 s | details |
| #8 | ACCEPTED | 0.06 s | details |
| #9 | ACCEPTED | 0.06 s | details |
| #10 | ACCEPTED | 0.06 s | details |
| #11 | ACCEPTED | 0.43 s | details |
| #12 | ACCEPTED | 0.42 s | details |
| #13 | ACCEPTED | 0.41 s | details |
Code
#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define LINF 999999999999999999LL
#define N (1<<17)
#define M 1000000007
using namespace std;
unordered_map<int, bool> m;
int v[5000];
int main () {
int n;
cin>>n;
int ans = 0;
for (int i = 0; i < n; i++) {
cin>>v[i];
for (int j = 0; j < i; j++) {
if (m[v[i] - v[j]]) {
ans++;
break;
}
}
for (int j = 0; j <= i; j++) {
m[v[i] + v[j]] = true;
}
}
cout<<ans<<endl;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 2
1 3 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 6
1 2 3 5 7 10 |
| correct output |
|---|
| 4 |
| user output |
|---|
| 4 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 3
-1 2 0 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 50
16291 48873 -24113 647 25407 7... |
| correct output |
|---|
| 17 |
| user output |
|---|
| 17 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 50
28605 44105 100000 15416 10000... |
| correct output |
|---|
| 6 |
| user output |
|---|
| 6 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 50
33946 -4739 33938 48034 100000... |
| correct output |
|---|
| 5 |
| user output |
|---|
| 5 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 50
47168 -43373 45399 49194 6990 ... |
| correct output |
|---|
| 21 |
| user output |
|---|
| 21 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 500
1 3 9 27 39 117 351 1053 1521 ... |
| correct output |
|---|
| 445 |
| user output |
|---|
| 445 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 500
1 3 9 27 81 243 351 1053 3159 ... |
| correct output |
|---|
| 448 |
| user output |
|---|
| 448 |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 500
1 3 9 27 39 75 225 675 975 292... |
| correct output |
|---|
| 444 |
| user output |
|---|
| 444 |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 5000
1 3 9 27 39 117 351 507 1521 4... |
| correct output |
|---|
| 4664 |
| user output |
|---|
| 4664 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 5000
1 3 9 27 39 75 225 339 1017 30... |
| correct output |
|---|
| 4455 |
| user output |
|---|
| 4455 |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 5000
1 3 9 13 25 47 85 157 289 531 ... |
| correct output |
|---|
| 4436 |
| user output |
|---|
| 4436 |