oj.uz

Submission #145544

# Submission time Handle Problem Language Result Execution time Memory
145544 2019-08-20T11:22:21 Z surface03 None (KOI18_arrowH) C++14
100 / 100
 52 ms 5976 KB 
#include<bits/stdc++.h>
using namespace std;
vector<long long>v[100010];
int main(){
    int n,i,j,x,y,len;
    long long ans=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d%d",&x,&y);
        v[y].push_back(x);
    }
    for(i=1;i<=n;i++){
        sort(v[i].begin(),v[i].end());
    }
    for(i=1;i<=n;i++){
        if(v[i].size()<=1)continue;
        len=v[i].size();
        for(j=1;j<len-1;j++){
            ans+=min(v[i][j]-v[i][j-1],v[i][j+1]-v[i][j]);
        }
        ans+=v[i][1]-v[i][0];
        ans+=v[i][len-1]-v[i][len-2];
    }
    printf("%lld",ans);
}

Compilation message

arrow.cpp: In function 'int main()':
arrow.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
arrow.cpp:9:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2684 KB Output is correct
5 Correct 4 ms 2684 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2708 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2684 KB Output is correct
5 Correct 4 ms 2684 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2708 KB Output is correct
9 Correct 5 ms 2680 KB Output is correct
10 Correct 5 ms 2680 KB Output is correct
11 Correct 5 ms 2680 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2684 KB Output is correct
5 Correct 4 ms 2684 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2708 KB Output is correct
9 Correct 5 ms 2680 KB Output is correct
10 Correct 5 ms 2680 KB Output is correct
11 Correct 5 ms 2680 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct
17 Correct 8 ms 2940 KB Output is correct
18 Correct 7 ms 2936 KB Output is correct
19 Correct 7 ms 2936 KB Output is correct
20 Correct 8 ms 2936 KB Output is correct
21 Correct 7 ms 2940 KB Output is correct
22 Correct 7 ms 2808 KB Output is correct
23 Correct 8 ms 2936 KB Output is correct
24 Correct 8 ms 2936 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2684 KB Output is correct
5 Correct 4 ms 2684 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2708 KB Output is correct
9 Correct 5 ms 2680 KB Output is correct
10 Correct 5 ms 2680 KB Output is correct
11 Correct 5 ms 2680 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct
17 Correct 8 ms 2940 KB Output is correct
18 Correct 7 ms 2936 KB Output is correct
19 Correct 7 ms 2936 KB Output is correct
20 Correct 8 ms 2936 KB Output is correct
21 Correct 7 ms 2940 KB Output is correct
22 Correct 7 ms 2808 KB Output is correct
23 Correct 8 ms 2936 KB Output is correct
24 Correct 8 ms 2936 KB Output is correct
25 Correct 52 ms 5976 KB Output is correct
26 Correct 39 ms 5212 KB Output is correct
27 Correct 48 ms 5624 KB Output is correct
28 Correct 39 ms 5112 KB Output is correct
29 Correct 52 ms 5624 KB Output is correct
30 Correct 38 ms 5112 KB Output is correct
31 Correct 40 ms 5112 KB Output is correct
32 Correct 47 ms 5624 KB Output is correct