oj.uz

답안 #930276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930276 2024-02-19T08:57:03 Z boris_mihov Event Hopping 2 (JOI21_event2) C++17
1 / 100
 3000 ms 3528 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <set>
 
typedef long long llong;
const int MAXN = 100000 + 10;
const int INF  = 2e9;
 
int n, k;
int l[MAXN];
int r[MAXN];
int perm[MAXN];
 
std::vector <int> sol;
std::vector <int> ans;
 
bool canAdd(int idx)
{
    int cntLeft = sol.size();
    for (const int &i : ans)
    {
        if ((l[i] <= l[idx] && l[idx] <= r[i]) || (l[idx] <= l[i] && l[i] <= r[idx]))
        {
            return false;
        }
    }
 
    for (const int &i : sol)
    {
        if ((l[i] <= l[idx] && l[idx] <= r[i]) || (l[idx] <= l[i] && l[i] <= r[idx]))
        {
            cntLeft--;
        }
    }
    
    return cntLeft + ans.size() + 1 >= k;
}
 
void removeIntersecting(int idx)
{
    std::vector <int> sol2;
    int cntLeft = sol.size();
    for (const int &i : sol)
    {
        if (!((l[i] <= l[idx] && l[idx] <= r[i]) || (l[idx] <= l[i] && l[i] <= r[idx])))
        {
            sol2.push_back(i);
        }
    }
 
    sol = sol2;
}
 
void solve()
{
    std::iota(perm + 1, perm + 1 + n, 1);
    std::sort(perm + 1, perm + 1 + n, [&](int x, int y)
    {
        return r[x] < r[y];  
    });
 
    int end = 0;
    for (int i = 1 ; i <= n ; ++i)
    {
        if (l[perm[i]] > end)
        {
            sol.push_back(perm[i]);
            end = r[perm[i]];
        }
    }
 
    if (sol.size() < k)
    {
        std::cout << -1 << '\n';
        return;
    }
 
    for (int i = 1 ; i <= n && ans.size() < k ; ++i)
    {
        if (canAdd(i))
        {
            ans.push_back(i);
            removeIntersecting(i);
        }
    }
 
    for (const int &idx : ans)
    {
        std::cout << idx << '\n';
    }
}
 
void input()
{
    std::cin >> n >> k;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> l[i] >> r[i];
        l[i]++;
    }
}
 
void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}   
 
int main()
{
    fastIOI();
    input();
    solve();
 
    return 0;
}

Compilation message

event2.cpp: In function 'bool canAdd(int)':
event2.cpp:42:37: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |     return cntLeft + ans.size() + 1 >= k;
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
event2.cpp: In function 'void removeIntersecting(int)':
event2.cpp:48:9: warning: unused variable 'cntLeft' [-Wunused-variable]
   48 |     int cntLeft = sol.size();
      |         ^~~~~~~
event2.cpp: In function 'void solve()':
event2.cpp:78:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |     if (sol.size() < k)
      |         ~~~~~~~~~~~^~~
event2.cpp:84:43: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   84 |     for (int i = 1 ; i <= n && ans.size() < k ; ++i)
      |                                ~~~~~~~~~~~^~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 3082 ms 3528 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 544 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 600 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 544 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 600 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Incorrect 1 ms 348 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 3082 ms 3528 KB Time limit exceeded
5 Halted 0 ms 0 KB -