oj.uz

Submission #880039

# Submission time Handle Problem Language Result Execution time Memory
880039 2023-11-28T16:01:55 Z cpptowin Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 4444 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
//struct BIT
//{
//    int t[maxn];
//    void up(int x,int val)
//    {
//        for( ; x < maxn ; x += lb(x)) t[x] += val;
//    }
//    int get(int x)
//    {
//        int ans = 0;
//        for( ; x ; x -= lb(x)) ans += t[x];
//        return ans;
//    }
//}t1;
int n,m,c[maxn];
int f[maxn];
pii a[maxn];
int arr[maxn];
main()
{
    #define name "TASK"
    if(fopen(name".inp","r"))
    {
       freopen(name".inp","r",stdin);
       freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    cin >> n >> m;
    fo(i,1,n) cin >> a[i].fi >> a[i].se;
    sort(a + 1,a + n + 1);
    fo(i,1,m) cin >> c[i];
    vi v;
//    fo(i,1,n) v.pb(a[i].se),arr[i] = a[i].se;
//    sort(v.begin(),v.end());
//    v.erase(unique(v.begin(),v.end()),v.end());
//    fo(i,1,n) arr[i] = lower_bound(v.begin(),v.end(),arr[i]) - v.begin() + 1;
//    fo(i,1,n) cout << arr[i] << "\n";
//    fo(i,1,n)
//    {
//        f[i] = t1.get(arr[i]);
//        t1.up(arr[i],1);
//    }
    sort(a + 1,a + n + 1,[](pii a,pii b)
         {
             return a.se > b.se or (a.se == b.se and a.fi > b.fi);
         });
    sort(c + 1,c + m + 1,greater<int>());
    fo(i,1,n)
    {
        int id = v.size();
        if(id < m and a[i].fi < c[id]) v.pb(a[i].se);
    }
//    cout << min(*max_element(f + 1,f + n + 1),m);
    cout << v.size();
}

Compilation message

joi2019_ho_t2.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main()
      | ^~~~
joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:45:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |        freopen(name".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:46:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |        freopen(name".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 50.0

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