Submission #139676

#TimeUsernameProblemLanguageResultExecution timeMemory
139676mechfrog88Exhibition (JOI19_ho_t2)C++14
10 / 100
1057 ms504 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #pragma GCC optimize("unroll-loops,no-stack-protector") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") using namespace __gnu_pbds; using namespace std; template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; typedef long long ll; typedef long double ld; struct pic{ ll v,s; bool operator <(const pic& rhs) const{ if (v == rhs.v){ return s < rhs.s; } return v < rhs.v; } }; vector <pic> arr; vector <ll> frame; ll ans = 0; ll n,m; void func(ll i,vector<ll>s){ if (i == n){ ll j = 0; for (ll z=0;z<s.size() && j < m;z++,j++){ while (j < m && s[z] > frame[j]){ j++; } if (j < m) ans = max(ans,z+1); } return; } func(i+1,s); s.push_back(arr[i].s); func(i+1,s); } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; arr.resize(n); for (int z=0;z<n;z++){ cin >> arr[z].s >> arr[z].v; } frame.resize(m); for (int z=0;z<m;z++){ cin >> frame[z]; } sort(arr.begin(),arr.end()); sort(frame.begin(),frame.end()); vector <ll> temp; func(0,temp); cout << ans << endl; }

Compilation message (stderr)

joi2019_ho_t2.cpp: In function 'void func(ll, std::vector<long long int>)':
joi2019_ho_t2.cpp:36:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (ll z=0;z<s.size() && j < m;z++,j++){
                     ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...