Submission #1173286

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173286		SmuggingSpun	Room Temperature (JOI24_ho_t1)	C++20	85 / 100	27 ms	2372 KiB

Main

#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
template<class T>void minimize(T& a, T b){
    if(a > b){
        a = b;
    }
}
template<class T>void maximize(T& a, T b){
    if(a < b){
        a = b;
    }
}
const int lim = 5e5 + 5;
int n, t, a[lim];
namespace sub1{
    void solve(){
        int d = abs(a[1] % t - a[2] % t);
        minimize(d, t - d);
        cout << ((d + 1) >> 1);
    }
}
namespace sub23{
    void solve(){
        if(t == 1){
            return void(cout << 0);
        }
        for(int i = 2; i <= n; i++){
            if((a[i] & 1) != (a[1] & 1)){
                return void(cout << 1);
            }
        }
        cout << 0;
    }
}
namespace sub4{
    void solve(){
        int ans = t;
        for(int i = 0; i < t; i++){
            int candidate = 0;
            for(int j = 1; j <= n; j++){
                int d = abs(a[j] - i) % t;
                maximize(candidate, min(d, t - d));
            }
            minimize(ans, candidate);
        }
        cout << ans;
    }
}
namespace sub5{
    void solve(){

    }
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
    cin >> n >> t;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    if(n == 2){
        sub1::solve();
    }
    else if(t <= 2){
        sub23::solve();
    }
    else if(max(n, t) <= 3000){
        sub4::solve();
    }
    else{
        sub5::solve();
    }
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:58:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |                 freopen(taskname".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

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