#945278 (C++14) No.1131 Deviation Score

• 問題: No.1131 Deviation Score
• ユーザー: naimonon77
• 提出日時: 2024-01-19 23:42:24
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 133 ms / 2,000 ms
• コード長: 2,471 bytes
• コンパイル時間: 1,863 ms
• コンパイル使用メモリ: 171,640 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-01-19 23:42:29
• 合計ジャッジ時間: 4,626 ms
• ジャッジサーバーID （参考情報）: judge14 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	30 ms; 6,676 KB
testcase_01	AC	4 ms; 6,676 KB
testcase_02	AC	116 ms; 6,676 KB
testcase_03	AC	53 ms; 6,676 KB
testcase_04	AC	108 ms; 6,676 KB
testcase_05	AC	40 ms; 6,676 KB
testcase_06	AC	133 ms; 6,676 KB
testcase_07	AC	55 ms; 6,676 KB
testcase_08	AC	99 ms; 6,676 KB
testcase_09	AC	38 ms; 6,676 KB
testcase_10	AC	96 ms; 6,676 KB
testcase_11	AC	100 ms; 6,676 KB
testcase_12	AC	87 ms; 6,676 KB
testcase_13	AC	115 ms; 6,676 KB
testcase_14	AC	25 ms; 6,676 KB
testcase_15	AC	24 ms; 6,676 KB
testcase_16	AC	101 ms; 6,676 KB
testcase_17	AC	42 ms; 6,676 KB
testcase_18	AC	131 ms; 6,676 KB
testcase_19	AC	3 ms; 6,676 KB
testcase_20	AC	2 ms; 6,676 KB
testcase_21	AC	2 ms; 6,676 KB

ソースコード

#define NOMINMAX
#define TEST_MODE true

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#include <regex>

using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rep2(i,a,n) for(int i=a;i<(int)(n);++i)
#define rrep(i,n) for(int i=(n)-1;i>=0;--i)
#define reu(i,n) for(int i=1;i<=(int)(n);++i)

#define chmax(a,b) (a=(a)<(b)?(b):(a))
#define chmin(a,b) (a=(a)>(b)?(b):(a))

using ll = long long;
#define all(a) begin(a),end(a)
#define int long long

#ifdef LOCAL_ENV
#define dump(x) cerr<<#x<<" : "<<(x)<< "   \t"
#define dumpl(x) dump(x)<<endl
#define cerr_endl cerr<<endl
ofstream ofstream1("out.txt");
#define cout ofstream1

#else
#define dump(x) 
#define dumpl(x)
#define cerr_endl 
#endif

#define abp(o,a,b) cout<<(((o)?a:b))<<endl
#define YEP(x) abp(x,"YES","NO")
#define Yep(x) abp(x,"Yes","No")

const int inf = (int)1 << 60;
ll mod_n = (int)1e9 + 7;

const int MAX = (int)2e6 + 5;
const int MAX2 = 2005;

template<typename T>void ce_vector(vector<T> a) {
#ifdef LOCAL_ENV
	rep(i, a.size() - 1) cerr << a[i] << " "; cerr << a[a.size() - 1] << endl;
#endif 
}

template<typename T>void ce_vector(vector<pair<T, T>> a) {
#ifdef LOCAL_ENV
	rep(i, a.size()) cerr << a[i].first << "," << a[i].second << " "; cerr << endl;
#endif 
}

template<typename T>void co_vector(vector<T> a) {
	rep(i, a.size() - 1) cout << a[i] << " "; cout << a[a.size() - 1] << endl;
}

template<typename T>void co_vector(vector<pair<T, T>> a) { rep(i, a.size()) cout << a[i].first << "," << a[i].second << " "; cout << endl; }

ll pow_n(ll x, ll n) { ll r = 1; while (n > 0) { if (n & 1)r = (r * x) % mod_n; x = (x * x) % mod_n; n >>= 1; }return r; }


template<typename T>
vector<T> in_vec(int n) {
	vector<T> a(n);
	a.resize(n);
	rep(i, n) cin >> a[i];
	return a;
}

int div_ceil(int a, int b) { int r = a / b; if (a % b != 0)r++; return r; }

ll modular(ll x) {
	return ((x % mod_n + mod_n) % mod_n);
}

// end of template


void solve() {
	int n; cin >> n;
	auto x = in_vec<int>(n);
	int sum = accumulate(all(x), 0);
	// 50 - (A - xi) / 2
	// 50 - (sum / n - xi) / 2
	// 50 - (sum - xi * n) / 2n
	double a = (double) sum / n;
	rep(i, n) {
		cout << (int)(50.0 - (a - x[i]) / 2.0) << endl;
	}
}















signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cout << fixed << setprecision(20);

	solve();

#ifdef LOCAL_ENV
	cerr << endl <<"\x1b[7m ↓ \x1b[0m" << endl;
	system("type out.txt");
#endif
	return 0;
}