結果
問題 | No.1034 テスターのふっぴーさん |
ユーザー |
|
提出日時 | 2020-04-24 22:23:21 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 1,571 bytes |
コンパイル時間 | 1,394 ms |
コンパイル使用メモリ | 123,468 KB |
最終ジャッジ日時 | 2025-01-10 00:02:28 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
コンパイルメッセージ
main.cpp: In function ‘void suzuken()’: main.cpp:41:26: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 41 | ll n, i, j; scanf("%lld %lld %lld", &n, &i, &j); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function ‘int main()’: main.cpp:70:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 70 | ll kkt; scanf("%lld", &kkt); | ~~~~~^~~~~~~~~~~~~~
ソースコード
#include <cstdio>#include <iostream>#include <string>#include <sstream>#include <stack>#include <algorithm>#include <cmath>#include <queue>#include <map>#include <set>#include <cstdlib>#include <bitset>#include <tuple>#include <assert.h>#include <deque>#include <bitset>#include <iomanip>#include <limits>#include <chrono>#include <random>#include <array>#include <unordered_map>#include <functional>#include <complex>#include <numeric>template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }constexpr long long MAX = 5100000;constexpr long long INF = 1LL << 60;constexpr int inf = 1000000007;constexpr long long mod = 1000000007LL;//constexpr long long mod = 998244353LL;using namespace std;typedef unsigned long long ull;typedef long long ll;void suzuken() {ll n, i, j; scanf("%lld %lld %lld", &n, &i, &j);ll mn = min({ i,j,n - 1 - i, n - 1 - j });ll len = n - mn * 2;ll tmp = ((n - 1) * 4 + (n - 1) * 4 + (mn - 1) * (-8)) * mn / 2;if (mn == i) {cout << tmp + j - mn << "\n";return;}tmp += len - 1;if (mn + len - 1 == j) {cout << tmp + i - mn << "\n";return;}tmp += len - 1;if (mn + len - 1 == i) {cout << tmp + (mn + len - 1) - j << "\n";return;}tmp += len - 1;cout << tmp + (mn + len - 1) - i << "\n";}int main(){/*cin.tie(nullptr);ios::sync_with_stdio(false);*/ll kkt; scanf("%lld", &kkt);while (kkt--) {suzuken();}return 0;}