제출 #320606

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
320606		teehandsome	Just Long Neckties (JOI20_ho_t1)	C++11	9 / 100	1092 ms	7448 KiB

ho_t1

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

template<typename T>
void _print(vector<T> x) {for(auto e:x) cerr<<e<<",";}
template<typename T>
void _print(T x) {cerr<<x;}

void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)

int n;
vector<int> a;
vector<int> b;

int solve(int x) {
    vector<int> ar;
    for(int i=0;i<=n;i++) {
        if(i!=x) ar.push_back(a[i]);
    }
    sort(all(ar));
    int mx=0;
    for(int i=0;i<n;i++) {
        int temp=max(0,ar[i]-b[i]);
        mx=max(mx,temp);
    }
    return mx;
}

int main () {
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n; a.resize(n+1); b.resize(n);
    for(int i=0;i<=n;i++) cin>>a[i];
    for(int i=0;i<n;i++) cin>>b[i]; sort(all(b));
    for(int i=0;i<=n;i++) {
        cout<<solve(i)<<' ';
    }
    cout<<endl;
}

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

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:51:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   51 |     for(int i=0;i<n;i++) cin>>b[i]; sort(all(b));
      |     ^~~
ho_t1.cpp:51:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   51 |     for(int i=0;i<n;i++) cin>>b[i]; sort(all(b));
      |                                     ^~~~

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 0 / 91