제출 #174634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
174634		CaroLinda	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	66 ms	8836 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
 
#define debug printf
#define lp(i,a,b) for(int i = a ; i < b ; i++ )
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define ll long long
#define sz size()
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define tiii tuple<int,int,int>
#define mkt make_tuple
 
const int MAXN = 2e5+10 ;
 
using namespace std ;
 
ll pref[MAXN] , suf[MAXN] ;
vector<pii> id ;

vector<int> find_subset(int l, int r, vector<int> w) 
{

	int tam = 1 ;
	bool ok = false ;
	vector<int> res ;

	lp(i,0,(int)(w.sz)) 
		if( w[i] <=  r) id.pb( mk(w[i],i) ) ;
	sort(all(id)) ;

	lp(i,0,(int)(id.sz))
		pref[i] = ( i == 0 ? 0LL : pref[i-1] ) + id[i].ff ;

	for(int i = (int)(id).sz - 1 ; i >= 0 ; i-- ) suf[i] = suf[i+1] + id[i].ff ;

	if( suf[0] < 1LL * l ) return vector<int>(0) ; 

	for(; tam <= (int)(id.sz) ; tam ++ )
		if( suf[ (int)(id.sz)-tam ] > 1LL * r )
			break ;

	tam -- ;

	if( suf[ (int)(id.sz)-tam ] >= 1LL * l )
	{
		lp(i,(int)(id.sz)-tam, (int)(id.sz) ) res.pb( id[i].ss ) ;
		return res ;
	}


	if( pref[tam] > 1LL * r  )
		return res ;

	ll tot = suf[ (int)(id.sz)-tam ] ;

	int curId = (int)(id.sz)-tam ;

	for(int k = 0 ; curId < (int)(id.sz) ; k++ )
	{
		if( k > 0 ){
			tot -= id[curId].ff ;
			curId ++ ;
		}
		tot += id[k].ff ;
		res.pb( id[k].ss ) ;
		if( tot >= 1LL*l && tot <= 1LL*r ) break ;
	}

	lp(i,curId, (int)(id.sz) ) res.pb( id[i].ss ) ;

	return res ;

}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:28:7: warning: unused variable 'ok' [-Wunused-variable]
  bool ok = false ;
       ^~

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