Submission #18870691


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())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
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 extended_gcd(int64 a, int64 b, int64& x, int64& y) {
  int64 t;
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  int64 d = extended_gcd(b, a % b, x, y);
  t = x, x = y;
  y = t - a / b * y;
  return d;
}

int main() {
  int cas;
  cin >> cas;
  while (cas--) {
    int64 n, S, K;
    cin >> n >> S >> K;
    int64 x, y;
    int64 g = extended_gcd(K, n, x, y);
    S = n - S;
    if (S % g) {
      cout << -1 << '\n';
      continue;
    }
    K /= g;
    n /= g;
    S /= g;
    x = x * S % n;
    if (x < 0) x += n;
    cout << x << '\n';
  }
  return 0;
}

Submission Info

Submission Time
Task E - Throne
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 500
Code Size 3139 Byte
Status AC
Exec Time 6 ms
Memory 3200 KB

Compile Error

./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
                                         ^
./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 500 / 500
Status
AC × 1
AC × 32
Set Name Test Cases
Sample sample_01.txt
All hand_01.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, random_27.txt, random_28.txt, random_29.txt, random_30.txt, sample_01.txt
Case Name Status Exec Time Memory
hand_01.txt AC 6 ms 3032 KB
random_01.txt AC 2 ms 3028 KB
random_02.txt AC 4 ms 3016 KB
random_03.txt AC 4 ms 3160 KB
random_04.txt AC 3 ms 3052 KB
random_05.txt AC 3 ms 3116 KB
random_06.txt AC 2 ms 3012 KB
random_07.txt AC 2 ms 3008 KB
random_08.txt AC 2 ms 3200 KB
random_09.txt AC 5 ms 3092 KB
random_10.txt AC 2 ms 3060 KB
random_11.txt AC 3 ms 3056 KB
random_12.txt AC 2 ms 3032 KB
random_13.txt AC 4 ms 3060 KB
random_14.txt AC 4 ms 3012 KB
random_15.txt AC 2 ms 3032 KB
random_16.txt AC 2 ms 3020 KB
random_17.txt AC 2 ms 3104 KB
random_18.txt AC 2 ms 3160 KB
random_19.txt AC 6 ms 3088 KB
random_20.txt AC 2 ms 3060 KB
random_21.txt AC 2 ms 3020 KB
random_22.txt AC 3 ms 3100 KB
random_23.txt AC 3 ms 3116 KB
random_24.txt AC 2 ms 3016 KB
random_25.txt AC 3 ms 3060 KB
random_26.txt AC 2 ms 3192 KB
random_27.txt AC 2 ms 3168 KB
random_28.txt AC 3 ms 3028 KB
random_29.txt AC 3 ms 3100 KB
random_30.txt AC 3 ms 3164 KB
sample_01.txt AC 2 ms 3088 KB