oj.uz

Submission #560512

# Submission time Handle Problem Language Result Execution time Memory
560512 2022-05-11T14:58:36 Z Tien_Noob Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 340 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e5;
pair<int, int> a[N + 1];
int n, m, c[N + 1], e[N + 1];
void read()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i].first >> a[i].second;
        e[i] = -1;
    }
    for (int i = 1; i <= m; ++ i)
    {
        cin >> c[i];
    }
    sort(c + 1, c + m + 1, greater<int> ());
    sort(a + 1, a + n + 1, greater<pair<int, int> > ());
}
void solve()
{
    int res = 0;
    int j = 1;
    for (int i = 1; i <= n; ++ i)
    {
        while(j <= n && c[j] >= a[i].first)
        {
            ++j;
        }
        if (j == 1)
        {
            continue;
        }
        if (a[i].second < e[j - 1])
        {
            continue;
        }
        int k = upper_bound(e + 1, e + n + 1, a[i].second) - e - 1;
        k = min(n - k + 1, j - 2);
        res = max(res, k + 1);
        k = n - k + 1;
        e[k] = max(e[k], a[i].second);
    }
    cout << res;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -