# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1104063 | 2024-10-22T16:03:15 Z | asdfghjk | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #define ll long long #define pb push_back #define all(x) x.begin(), x.end() #define F first #define ld long double #define S second using namespace std; const ll N = 4e5 + 5; const ll NN = 4e5 + 5; const ll INF = 1e18; const ll inf = 1e9; const ll MOD = 1e9 + 7; vector <int> find_subset(int l,int r,vector <int> a){ vector <int> ans; ans.clear(); bool sub1 = 1; int n = s.size(); for(int i = 1;i < n;i++){ if(a[i] != a[i- 1]){ sub1 = 0; break; } } if(sub1 == 1 && n <= 100 && max(l,r) <= 100){ l = (l / a[0]) + (l % a[0] != 0); r = (r / a[0]); if(l <= r){ for(int i = 1;i <= l;i++){ ans.pb(a[0]); } } } return ans; }