제출 #1319182

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319182		jamezzz	Room Temperature (JOI24_ho_t1)	C++20	70 / 100	1 ms	332 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define psf push_front
#define ppb pop_back
#define ppf pop_front
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(),x.end()
#define lb(x,v) (lower_bound(all(x),v)-x.begin())
#define ub(x,v) (upper_bound(all(x),v)-x.begin())
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> iii;
typedef tuple<int,int,int,int> iiii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define mod 1000000007

int n, t;
set<int> s;

int main() {
    sf("%d%d", &n, &t);
    for (int i = 0; i < n; ++i) {
        int a; sf("%d", &a);
        if (a < t) s.insert(t);
        else s.insert(a % t + t);
    }
    int ans = (*(--s.end()) - *s.begin() + 1) / 2;
    while (*--s.end() >= t) {
        int a = *--s.end();
        s.erase(a);
        s.insert(a - t);
        ans = min(ans, (*(--s.end()) - *s.begin() + 1) / 2);
    }
    pf("%d\n", ans);
}

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

Main.cpp: In function 'int main()':
Main.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     sf("%d%d", &n, &t);
      |       ^
Main.cpp:45:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         int a; sf("%d", &a);
      |                  ^

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