제출 #209496

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
209496		Sho10	Meetings (IOI18_meetings)	C++14	0 / 100	27 ms	2324 KiB

meetings

/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll a[100005],cnt[100005];
vector<ll>pos;
vector<ll>ans;
vector<ll> minimum_costs(vector<int>H,vector<int>L,vector<int>R){
    ll n=H.size();
    ll q=L.size();
for(ll i=0;i<H.size();i++)
    a[i+1]=H[i];
    for(ll i=1;i<=n;i++)
    {
        if(a[i]==2){
            cnt[i]=cnt[i-1]+1;
            pos.pb(i);
        }else cnt[i]=cnt[i-1];
    }
    ll x=0;
    while(x<q){
        ll l=L[x],r=R[x];
        l++;
        r++;
        if(cnt[r]-cnt[l-1]==0){
            ans.pb(r-l+1);
            goto End;
        }else {
        ll x=pos[cnt[l]-1],y=pos[cnt[r]-1];
        if(cnt[r]-cnt[l-1]==1){
            ans.pb(r-l+2);
            goto End;
        }else {
        ll sum=x-l+r-y+(r-l+1-x+l-r+y)*2;
        ans.pb(sum);
        goto End;
        }
    }
    End:x++;
    }
    return ans;
}

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

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:30:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(ll i=0;i<H.size();i++)
            ~^~~~~~~~~
meetings.cpp:30:1: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 for(ll i=0;i<H.size();i++)
 ^~~
meetings.cpp:32:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for(ll i=1;i<=n;i++)
     ^~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40