結果

問題 No.353 ヘイトプラス
ユーザー GeckoCPPSonata
提出日時 2019-09-02 16:29:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,469 bytes
コンパイル時間 1,087 ms
コンパイル使用メモリ 109,648 KB
最終ジャッジ日時 2025-01-07 16:18:37
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample TLE * 2
other AC * 2 TLE * 5
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma region
#include <set> //..........................................................
#include <map> //..........................................................
#include <list> //..........................................................
#include <queue> //..........................................................
#include <stack> //..........................................................
#include <cmath> //..........................................................
#include <ctime> //..........................................................
#include <cstdio> //..........................................................
#include <vector> //..........................................................
#include <string> //..........................................................
#include <bitset> //..........................................................
#include <cctype> //..........................................................
#include <cstdlib> //..........................................................
#include <cstring> //..........................................................
#include <utility> //..........................................................
#include <numeric> //..........................................................
#include <complex> //..........................................................
#include <sstream> //..........................................................
#include <fstream> //..........................................................
#include <iomanip> //..........................................................
#include <cassert> //..........................................................
#include <iostream> //..........................................................
#include <iterator> //..........................................................
#include <algorithm>//..........................................................
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
const char alphabetl[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j',
'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't',
'u', 'v', 'w', 'x', 'y', 'z'};
const char alphabetu[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J',
'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T',
'U', 'V', 'W', 'X', 'Y', 'Z'};
const double pi = 3.141592653589793238462643383279502884197169;
const double napier = 2.718281828459045235360287471352662497757247;
static const double EPS = 1e-14;
static const ll INFLL = 1e18;
static const int INF = (1 << 30) - 1;
const int NM = 10100;//max index of array
#define SZ(x) ((int)(x).size())
#define rrep(i,n) for(int i=(n-1); i>=0; i--)
#define rreps(i,n) for(int i=(n); i>=0; i--)
#define RFOR(i,a,b) for(int i=a; i>(int)(b); i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define PRINT(n) cout << n << "\n";
#define PRINT2(n, m) cout << n << " " << m << " "<< "\n";
#define IN(a, x, b) (a<=x && x<b)
#define pb push_back
unsigned int bitReverse(unsigned int data){
data = ((data & 0x55555555) << 1)
| ((data & 0xAA555555) >> 1);
data = ((data & 0x33333333) << 2)
| ((data & 0xCCCCCCCC) >> 2);
data = ((data & 0x0F0F0F0F) << 4)
| ((data & 0xF0F0F0F0) >> 4);
data = ((data & 0x00FF00FF) << 8)
| ((data & 0xFF00FF00) >> 8);
data = (data << 16) | (data >> 16);
return data;
}
const ll MAX_V = 1010;
const ll MAX_E = 2010;
ll V, E;
struct edge {
ll from;
ll to;
ll cost;
};
edge ES[MAX_E];
ll d[MAX_V];
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void Main();
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
#pragma endregion
/***
* yukicoder No.353
* 2019/09/02 GeckoCPPSonata
***/
void Main(){
// Write your source code Here...
ll A, B;
cin >> A >> B;
ll ans = 2e9;
rrep(i,1e9) {
if (A <= 0) ans--;
else A--;
if (B <= 0) ans--;
else B--;
}
PRINT(ans)
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0