oj.uz

Submission #363673

# Submission time Handle Problem Language Result Execution time Memory
363673 2021-02-06T19:23:17 Z denkendoemeer Dragon 2 (JOI17_dragon2) C++14
100 / 100
 2531 ms 3948 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct pct
{
    ll x,y;
}a,b;
bool cmp(pct x,pct y,pct z)
{
    if ((x.x-y.x)*(z.y-y.y)<(x.y-y.y)*(z.x-y.x))
        return 1;
    return 0;
}
vector<pct>g[30005];
int main()
{
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    int n,m,t,x,y,q;
    scanf("%d%d",&n,&m);
    int i;
    for(i=1;i<=n;i++){
        scanf("%lld%lld%d",&a.x,&a.y,&t);
        g[t].push_back(a);
    }
    scanf("%lld%lld%lld%lld%d",&a.x,&a.y,&b.x,&b.y,&q);
    for(i=1;i<=q;i++){
        scanf("%d%d",&x,&y);
        int ans=0;
        for(auto it:g[x])
            for(auto it2:g[y]){
                if (cmp(it,a,b))
                    if (cmp(it,a,it2) && cmp(it2,b,it))
                        ans++;
                    else
                        ;
                else
                    if (cmp(it2,a,it) && cmp(it,b,it2))
                        ans++;
            }
        printf("%d\n",ans);
    }
return 0;
}

Compilation message

dragon2.cpp: In function 'int main()':
dragon2.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   20 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
dragon2.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |         scanf("%lld%lld%d",&a.x,&a.y,&t);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
dragon2.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     scanf("%lld%lld%lld%lld%d",&a.x,&a.y,&b.x,&b.y,&q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dragon2.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1132 KB Output is correct
2 Correct 19 ms 1132 KB Output is correct
3 Correct 27 ms 1260 KB Output is correct
4 Correct 45 ms 2156 KB Output is correct
5 Correct 38 ms 2284 KB Output is correct
6 Correct 3 ms 1260 KB Output is correct
7 Correct 4 ms 1260 KB Output is correct
8 Correct 8 ms 1132 KB Output is correct
9 Correct 6 ms 1132 KB Output is correct
10 Correct 6 ms 1132 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1065 ms 2472 KB Output is correct
2 Correct 2069 ms 2540 KB Output is correct
3 Correct 59 ms 2668 KB Output is correct
4 Correct 13 ms 2540 KB Output is correct
5 Correct 15 ms 2668 KB Output is correct
6 Correct 979 ms 2464 KB Output is correct
7 Correct 1008 ms 2464 KB Output is correct
8 Correct 446 ms 2536 KB Output is correct
9 Correct 461 ms 2280 KB Output is correct
10 Correct 449 ms 2300 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1132 KB Output is correct
2 Correct 19 ms 1132 KB Output is correct
3 Correct 27 ms 1260 KB Output is correct
4 Correct 45 ms 2156 KB Output is correct
5 Correct 38 ms 2284 KB Output is correct
6 Correct 3 ms 1260 KB Output is correct
7 Correct 4 ms 1260 KB Output is correct
8 Correct 8 ms 1132 KB Output is correct
9 Correct 6 ms 1132 KB Output is correct
10 Correct 6 ms 1132 KB Output is correct
11 Correct 1065 ms 2472 KB Output is correct
12 Correct 2069 ms 2540 KB Output is correct
13 Correct 59 ms 2668 KB Output is correct
14 Correct 13 ms 2540 KB Output is correct
15 Correct 15 ms 2668 KB Output is correct
16 Correct 979 ms 2464 KB Output is correct
17 Correct 1008 ms 2464 KB Output is correct
18 Correct 446 ms 2536 KB Output is correct
19 Correct 461 ms 2280 KB Output is correct
20 Correct 449 ms 2300 KB Output is correct
21 Correct 1035 ms 2408 KB Output is correct
22 Correct 2041 ms 2540 KB Output is correct
23 Correct 2380 ms 2924 KB Output is correct
24 Correct 587 ms 3768 KB Output is correct
25 Correct 59 ms 3692 KB Output is correct
26 Correct 53 ms 3948 KB Output is correct
27 Correct 19 ms 2924 KB Output is correct
28 Correct 24 ms 2924 KB Output is correct
29 Correct 2531 ms 3688 KB Output is correct
30 Correct 78 ms 3560 KB Output is correct
31 Correct 52 ms 3816 KB Output is correct
32 Correct 68 ms 3820 KB Output is correct
33 Correct 495 ms 3820 KB Output is correct
34 Correct 51 ms 3948 KB Output is correct
35 Correct 50 ms 3692 KB Output is correct
36 Correct 52 ms 3692 KB Output is correct
37 Correct 54 ms 3948 KB Output is correct
38 Correct 874 ms 3948 KB Output is correct
39 Correct 732 ms 3820 KB Output is correct
40 Correct 543 ms 3948 KB Output is correct
41 Correct 2316 ms 3692 KB Output is correct
42 Correct 1538 ms 3692 KB Output is correct
43 Correct 1216 ms 3564 KB Output is correct
44 Correct 1587 ms 2856 KB Output is correct
45 Correct 769 ms 2668 KB Output is correct
46 Correct 487 ms 2928 KB Output is correct
47 Correct 1043 ms 2664 KB Output is correct
48 Correct 667 ms 2796 KB Output is correct
49 Correct 399 ms 2796 KB Output is correct