# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
942812 | 2024-03-11T04:55:51 Z | irmuun | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 600 KB |
#include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() vector<int>find_subset(int l,int u,vector<int>w){ int n=(int)w.size(); vector<pair<ll,int>>v(n); ll L=l,U=u,tot=0; for(int i=0;i<n;i++){ v[i].ff=w[i]; v[i].ss=i; } sort(all(v)); int r=0; vector<int>ans; for(int i=0;i<n;i++){ if(tot+v[i].ff<=u){ tot+=v[i].ff; r=i+1; ans.pb(i); } else{ break; } } if(r==0) return {}; if(r==n&&tot<l) return {}; ll curr=n-1; for(int i=(int)ans.size()-1;i>=0;i--){ if(tot-v[ans[i]].ff+v[curr].ff<l){ tot=tot-v[ans[i]].ff+v[curr].ff; ans[i]=curr; curr--; } else{ for(int j=i+1;j<=curr;j++){ tot=tot-v[ans[i]].ff+v[j].ff; ans[i]=j; if(l<=tot) break; } break; } } if(tot<l) return {}; for(auto &x:ans){ x=v[x].ss; } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 600 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 440 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | OK (n = 12, answer = YES) |
2 | Correct | 1 ms | 436 KB | OK (n = 12, answer = YES) |
3 | Correct | 0 ms | 348 KB | OK (n = 12, answer = NO) |
4 | Correct | 1 ms | 432 KB | OK (n = 12, answer = NO) |
5 | Incorrect | 0 ms | 348 KB | sum of weights should be in [290..300] but it is 301 |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 600 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 440 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Correct | 1 ms | 348 KB | OK (n = 12, answer = YES) |
21 | Correct | 1 ms | 436 KB | OK (n = 12, answer = YES) |
22 | Correct | 0 ms | 348 KB | OK (n = 12, answer = NO) |
23 | Correct | 1 ms | 432 KB | OK (n = 12, answer = NO) |
24 | Incorrect | 0 ms | 348 KB | sum of weights should be in [290..300] but it is 301 |
25 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 600 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 440 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Correct | 1 ms | 348 KB | OK (n = 12, answer = YES) |
21 | Correct | 1 ms | 436 KB | OK (n = 12, answer = YES) |
22 | Correct | 0 ms | 348 KB | OK (n = 12, answer = NO) |
23 | Correct | 1 ms | 432 KB | OK (n = 12, answer = NO) |
24 | Incorrect | 0 ms | 348 KB | sum of weights should be in [290..300] but it is 301 |
25 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 600 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 440 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Correct | 1 ms | 348 KB | OK (n = 12, answer = YES) |
21 | Correct | 1 ms | 436 KB | OK (n = 12, answer = YES) |
22 | Correct | 0 ms | 348 KB | OK (n = 12, answer = NO) |
23 | Correct | 1 ms | 432 KB | OK (n = 12, answer = NO) |
24 | Incorrect | 0 ms | 348 KB | sum of weights should be in [290..300] but it is 301 |
25 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 600 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 440 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Correct | 1 ms | 348 KB | OK (n = 12, answer = YES) |
21 | Correct | 1 ms | 436 KB | OK (n = 12, answer = YES) |
22 | Correct | 0 ms | 348 KB | OK (n = 12, answer = NO) |
23 | Correct | 1 ms | 432 KB | OK (n = 12, answer = NO) |
24 | Incorrect | 0 ms | 348 KB | sum of weights should be in [290..300] but it is 301 |
25 | Halted | 0 ms | 0 KB | - |