제출 #261411

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261411		Valera_Grinenko	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	62 ms	4984 KiB

molecules

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include "molecules.h"
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> find_subset(int l, int u, vector<int> w) {
  int n = w.size();
  vector<pair<int, int> > a(n);
  for(int i = 0; i < n; i++) {
    a[i].fi = w[i];
    a[i].se = i;
  }
  sort(all(a));
  vector<int> ans;
  int cur = a[0].fi, lb = 0, rb = 1;
  while(lb < n) {
    while(rb < n && cur < l) cur += a[rb++].fi;
    if(cur >= l && cur <= u) break;
    cur -= a[lb++].fi;
  }
  for(; lb < rb; lb++) ans.pb(a[lb].se);
  return ans;
}
/*

*/

컴파일 시 표준 에러 (stderr) 메시지

molecules.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

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