Submission #17750876


Source Code Expand

Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int64 solve(int X, int n) {
  int ll = 1, rr = min(n, X - 1);
  ll = max(ll, X - min(X - ll, n));
  return max(0, rr - ll + 1);
}

int main() {
  int n, m;
  cin >> n >> m;
  int64 ret = 0;
  for (int X = 2; X <= 2 * n; ++X) {
    int Y = m + X;
    ret += solve(X, n) * solve(Y, n);
  }
  cout << ret << endl;
  return 0;
}

Submission Info

Submission Time
Task B - Quadruple
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 400
Code Size 2825 Byte
Status AC
Exec Time 8 ms
Memory 3200 KB

Compile Error

./Main.cpp:78:11: warning: unused variable 'INF' [-Wunused-const-variable]
const int INF = 1 << 29;
          ^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
2 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 21
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt
All 00-sample-001.txt, 00-sample-002.txt, 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 8 ms 3148 KB
00-sample-002.txt AC 2 ms 3048 KB
01-001.txt AC 2 ms 3024 KB
01-002.txt AC 2 ms 3060 KB
01-003.txt AC 2 ms 3104 KB
01-004.txt AC 4 ms 3112 KB
01-005.txt AC 2 ms 3032 KB
01-006.txt AC 4 ms 3108 KB
01-007.txt AC 2 ms 3104 KB
01-008.txt AC 3 ms 3160 KB
01-009.txt AC 3 ms 3164 KB
01-010.txt AC 4 ms 3152 KB
01-011.txt AC 2 ms 3020 KB
01-012.txt AC 3 ms 3012 KB
01-013.txt AC 3 ms 3016 KB
01-014.txt AC 2 ms 3024 KB
01-015.txt AC 4 ms 3020 KB
01-016.txt AC 3 ms 3104 KB
01-017.txt AC 3 ms 3108 KB
01-018.txt AC 3 ms 3008 KB
01-019.txt AC 3 ms 3200 KB