제출 #992130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
992130		8pete8	Room Temperature (JOI24_ho_t1)	C++17	100 / 100	79 ms	12488 KiB

Main

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<cassert>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset> 
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
#define int long long
const int mod=1e9+7,mxn=1e5+5,lg=30,inf=1e18,minf=-1e9,Mxn=100000;
void setIO(string name){		
	ios_base::sync_with_stdio(0); cin.tie(0);		
	freopen((name+".in").c_str(),"r",stdin);		
	freopen((name+".out").c_str(),"w",stdout);	
}
int32_t main(){
	fastio
	int n,m;cin>>n>>m;
	vector<int>v(n);
	for(int i=0;i<n;i++)cin>>v[i];
	vector<int>h;
	int mx=minf;
	for(auto i:v){
		h.pb((i%m));
		mx=max(mx,(i%m));
	}
	sort(all(h));
	int ans=inf;
	ans=(h[n-1]-h[0]+1)/2;
	for(int i=0;i<n-1;i++)ans=min(ans,(-h[i+1]+h[i]+1+m)/2);
	cout<<ans;
	return 0;
}
/*

int i,j
dp[i][j]=min(dp[i-1][k]+(j-k) k<=j,dp[i-1][j])

*/

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

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:35:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:36:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 5 / 5
• Subtask 3: 30 / 30
• Subtask 4: 35 / 35
• Subtask 5: 15 / 15