제출 #1248742

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1248742		al_reem_2010	Detecting Molecules (IOI16_molecules)	C++20	10 / 100	0 ms	328 KiB

molecules

// اَللَهُمَ صَلِ عَلَىَ مُحَمَدٍ وَ آلِ مُحَمَدٍ
//#include "bits/stdc++.h"
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <thread>
#include <fstream>
#include <stack>
using namespace std ;
//#define int long long
#define pb push_back
#define si size()
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define applejuice ios::sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
const int inf=1e18 ;
const int mod=1e9+7 ;
const int maxn=1e5+7 ;
int tt=1 ;
vector<int> find_subset(int l, int u, vector<int> w)
{
    vector<int> result, mnv, mxv;
    int mn=*min_element(all(w)) , mx=*max_element(all(w)) ;
    for(int i=0 ; i<w.si ; i++) {if(w[i]==mn) {mnv.pb(i) ;} else {mxv.pb(i) ;}}
    int a1=0 , a2=0 ;
    if(mn==mx)
    {
        for(int i=0 ; i<mnv.si ; i++) {if(l<=mn*i && mn*i<=u) {a1=i ;}}
    }
    else
    {
        for(int i=0 ; i<=mnv.si ; i++)
        {
            for(int j=0 ; j<=mxv.si ; j++)
            {
                if(l<=(mn*i)+(mx*j) && (mn*i)+(mx*j)<=u) {a1=i ; a2=j ;}
            }
        }
    }
    for(int i=0 ; i<a1 ; i++) {result.pb(mnv[i]) ;}
    for(int i=0 ; i<a2 ; i++) {result.pb(mxv[i]) ;}
    return result ;
}

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

molecules.cpp:22:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   22 | const int inf=1e18 ;
      |               ^~~~
molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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