Submission #345216

#	Time	Username	Problem	Language	Result	Execution time	Memory
345216		Kerim	Just Long Neckties (JOI20_ho_t1)	C++17	9 / 100	21 ms	2284 KiB

ho_t1

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
PII arr[MAXN];
int a[MAXN],ans[MAXN];
int main(){
    //freopen("file.in", "r", stdin);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n+1;i++)
    	scanf("%d",&arr[i].ff),arr[i].ss=i;
    sort(arr+1,arr+n+2);
    for(int i=1;i<=n;i++)
    	scanf("%d",a+i);
    sort(a+1,a+n+1);
    for(int i=1;i<=n+1;i++){
		for(int j=1;j<i;j++)
			umax(ans[arr[i].ss],arr[j].ff-a[j]);
		for(int j=i+1;j<=n+1;j++)	
			umax(ans[arr[i].ss],arr[j].ff-a[j-1]);
    }
    for(int i=1;i<=n+1;i++)
    	printf("%d ",ans[i]);
    puts("");
	return 0;
}

Compilation message (stderr)

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
ho_t1.cpp:27:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |      scanf("%d",&arr[i].ff),arr[i].ss=i;
      |      ~~~~~^~~~~~~~~~~~~~~~~
ho_t1.cpp:30:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |      scanf("%d",a+i);
      |      ~~~~~^~~~~~~~~~

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