oj.uz

Submission #97020

# Submission time Handle Problem Language Result Execution time Memory
97020 2019-02-13T10:50:00 Z Kastanda The Forest of Fangorn (CEOI14_fangorn) C++11
50 / 100
 3000 ms 888 KB 
// And you were like ooo-aa--ooo
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair < ll , ll > pii;
const int N = 205, MXN = 10004;
int n, m, W, H, A[N], B[N], X[MXN], Y[MXN];
bool M[MXN];
void Prnt(vector < int > vec)
{
    for (int id : vec)
        printf("%d ", id);
    printf("\n");
}
int main()
{
    scanf("%d%d%d%d%d", &W, &H, &X[0], &Y[0], &m);
    for (int i = 1; i <= m; i ++)
        scanf("%d%d", &X[i], &Y[i]);
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++)
        scanf("%d%d", &A[i], &B[i]);
    vector < ld > Ang;
    for (int i = 1; i <= n; i ++)
    {
        Ang.clear();
        for (int j = 1; j <= n; j ++)
            if (i != j)
                Ang.push_back(arg(complex < ld > {(ld)(A[i] - A[j]), (ld)(B[i] - B[j])}));
        sort(Ang.begin(), Ang.end());

        ld ang = arg(complex < ld > {(ld)(X[0] - A[i]), (ld)(Y[0] - B[i])});
        int lb0 = lower_bound(Ang.begin(), Ang.end(), ang) - Ang.begin();
        if (lb0 == Ang.size()) lb0 = 0;

        for (int j = 1; j <= m; j++)
        {
            ld ang = arg(complex < ld > {(ld)(X[j] - A[i]), (ld)(Y[j] - B[i])});
            int lb = lower_bound(Ang.begin(), Ang.end(), ang) - Ang.begin();
            if (lb == Ang.size()) lb = 0;

            if (lb != lb0)
                M[j] = 1;
        }
    }
    vector < int > vec;
    for (int i = 1; i <= m; i++)
        if (!M[i])
            vec.push_back(i);
    printf("%d\n", (int)vec.size());
    for (int id : vec)
        printf("%d ", id);
    return 0;
}

Compilation message

fangorn.cpp: In function 'int main()':
fangorn.cpp:35:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (lb0 == Ang.size()) lb0 = 0;
             ~~~~^~~~~~~~~~~~~
fangorn.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (lb == Ang.size()) lb = 0;
                 ~~~^~~~~~~~~~~~~
fangorn.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d%d%d", &W, &H, &X[0], &Y[0], &m);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fangorn.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &X[i], &Y[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
fangorn.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
fangorn.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &A[i], &B[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 7 ms 256 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
12 Correct 8 ms 384 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Runtime error 161 ms 888 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3008 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -