제출 #365565

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
365565		iliccmarko	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	364 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 1000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define single_case solve();
#define line cerr<<"----------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); }
#define mod 1000000007LL
const int N = 2e5 + 5;
pair<int, int> a[N];

vector<int> find_subset(int l, int u, vector<int> w)
{
   vector<int> res;
   int ind = 0;
   for(int x : w)
   {
       a[ind].first = x;
       a[ind].second = ind;
       ind++;
   }
   int n = len(w);
   sort(a, a+n);
   for(int i = 0;i<n;i++)
   {
       if(a[i].first>=l&&a[i].first<=u)
       {
           res.pb(a[i].second);
           return res;
       }
   }
   for(int i = 0;i<n-1;i++)
   {
       if(a[i].first+a[n-1].first>=l&&a[i].first+a[n-1].first<=u)
       {
           res.pb(a[i].second);
           res.pb(a[n-1].second);
           return res;
       }
   }
   return res;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31