Upload 4 files

cpp_dataset/test/test.jsonl

@@ -51,7 +51,6 @@
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mp[1005][1005];\n long long n, a, b;\n void output() {\n   for (long long i = 1; i <= n; i++) {\n     for (long long j = 1; j <= n; j++) {\n       if (i == j)\n         printf( 0 );\n       else\n         printf( %lld , a < b ? !mp[i][j] : mp[i][j]);\n     }\n     printf( \n );\n   }\n }\n int main() {\n   scanf( %lld%lld%lld , &n, &a, &b);\n   long long root = 2;\n   if ((a != 1 && b != 1)) {\n     printf( NO\n );\n     return 0;\n   }\n   if (n == 2 && a == 1 && b == 1) {\n     printf( NO\n );\n     return 0;\n   }\n   if (n == 3 && a == 1 && b == 1) {\n     printf( NO\n );\n     return 0;\n   }\n   printf( YES\n );\n   if (a == 1 && b == 1)\n     for (long long i = 1; i < n; i++) mp[i][i + 1] = mp[i + 1][i] = true;\n   else\n     for (long long i = 0; i < n - max(a, b); i++, root++)\n       mp[1][root] = mp[root][1] = true;\n   output();\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long power(long long a, long long b) {\n   long long ans = 1;\n   while (b > 0) {\n     if (b % 2 != 0) {\n       ans = (ans * a) % 1000000007;\n     }\n     a = ((a % 1000000007) * (a % 1000000007)) % 1000000007;\n     b >>= 1;\n   }\n   return ans;\n }\n void sieve(int n) {\n   bool prime[n + 1];\n   memset(prime, true, sizeof(prime));\n   for (int p = 2; p * p <= n; p++) {\n     if (prime[p]) {\n       for (int i = p * p; i <= n; i += p) prime[i] = false;\n     }\n   }\n   for (int p = 2; p <= n; p++) {\n     if (prime[p]) cout << p <<    ;\n   }\n }\n int main() {\n   std::ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   int t = 1;\n   cin >> t;\n   while (t--) {\n     int n, k;\n     cin >> n >> k;\n     vector<vector<int>> v;\n     for (int i = 0; i < k; i++) {\n       int c;\n       cin >> c;\n       vector<int> temp;\n       for (int j = 0; j < c; j++) {\n         int z;\n         cin >> z;\n         temp.push_back(z);\n       }\n       v.push_back(temp);\n     }\n     int l = 1, h = n;\n     int ma;\n     cout <<  ? \n          <<     << n <<    ;\n     for (int i = 1; i <= n; i++) cout << i <<    ;\n     cout << endl;\n     cin >> ma;\n     for (int i = 0; i < 10; i++) {\n       int mid = (h + l) / 2;\n       int temp;\n       cout <<  ? \n            <<     << mid - l + 1 <<    ;\n       for (int kha = l; kha <= mid; kha++) cout << kha <<    ;\n       cout << endl;\n       cin >> temp;\n       if (temp == ma)\n         h = mid;\n       else\n         l = mid;\n     }\n     int ind = h;\n     bool flag = false;\n     vector<int> ans;\n     for (int i = 0; i < v.size(); i++) {\n       sort(v[i].begin(), v[i].end());\n       for (int j = 0; j < v[i].size(); j++) {\n         if (v[i][j] == ind) {\n           flag = true;\n           cout <<  ? \n                <<    ;\n           vector<int> loa;\n           for (int lo = 1; lo <= n; lo++) {\n             if (binary_search(v[i].begin(), v[i].end(), lo) == false) {\n               loa.push_back(lo);\n             }\n           }\n           cout << loa.size() <<    ;\n           for (auto lo : loa) cout << lo <<    ;\n           cout << endl;\n           int kha;\n           cin >> kha;\n           ans.push_back(kha);\n         }\n       }\n       if (flag == false) {\n         ans.push_back(ma);\n       } else {\n         flag = false;\n       }\n     }\n     cout <<  ! \n          <<    ;\n     for (auto i : ans) cout << i <<    ;\n     cout << endl;\n     string sa;\n     cin >> sa;\n     if (sa ==  Correct ) {\n       continue;\n     } else {\n       return 0;\n     }\n   }\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e18;\n const int maxn = 2e6 + 10;\n int a[maxn], cnt[maxn];\n long long sum[maxn];\n int main(void) {\n   int n, x, y;\n   scanf( %d %d %d , &n, &x, &y);\n   int z = x / y;\n   for (int i = 1; i <= n; i++)\n     scanf( %d , a + i), cnt[a[i]]++, sum[a[i]] += a[i];\n   for (int i = 1; i <= 2000000; i++) cnt[i] += cnt[i - 1], sum[i] += sum[i - 1];\n   long long ans = INF;\n   for (int i = 2; i <= 1000000; i++) {\n     long long tmp = 0;\n     int zz = min(z, i - 1);\n     for (int j = 1; (j - 1) * i < 1000000; j++) {\n       if (i - zz - 2 >= 0)\n         tmp += (long long)(cnt[j * i - zz - 1] - cnt[j * i - i]) * x;\n       if (zz)\n         tmp += ((long long)i * j * (cnt[j * i - 1] - cnt[j * i - zz - 1]) -\n                 (sum[j * i - 1] - sum[j * i - zz - 1])) *\n                y;\n     }\n     ans = min(ans, tmp);\n   }\n   printf( %I64d\n , ans);\n   return 0;\n }\n "}
-{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int md = 1e9 + 7;\n int n;\n char s[111];\n int f[111][3333];\n int main() {\n   int t;\n   f[0][0] = 1;\n   for (int i = 1; i <= 100; ++i) {\n     for (int j = 0; j <= 3000; ++j) {\n       for (int c = 0; c <= min(j, 25); ++c) {\n         f[i][j] += f[i - 1][j - c];\n         f[i][j] %= md;\n       }\n     }\n   }\n   scanf( %d , &t);\n   while (t--) {\n     scanf( %s , s);\n     int sum = 0;\n     for (int i = 0; i < strlen(s); ++i) sum += s[i] - 'a';\n     printf( %d\n , (f[strlen(s)][sum] + md - 1) % md);\n   }\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize ( O3 )\n #pragma GCC target ( sse4 )\n  \n using namespace std;\n  \n typedef long long ll;\n typedef long double ld;\n typedef complex<ld> cd;\n  \n typedef pair<int, int> pi;\n typedef pair<ll,ll> pl;\n typedef pair<ld,ld> pd;\n  \n typedef vector<int> vi;\n typedef vector<ld> vd;\n typedef vector<ll> vl;\n typedef vector<pi> vpi;\n typedef vector<pl> vpl;\n typedef vector<cd> vcd;\n \n template<class T> using pq = priority_queue<T>;\n template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n  \n #define FOR(i, a, b) for (int i=a; i<(b); i++)\n #define F0R(i, a) for (int i=0; i<(a); i++)\n #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)\n #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)\n #define trav(a,x) for (auto& a : x)\n #define uid(a, b) uniform_int_distribution<int>(a, b)(rng)\n  \n #define sz(x) (int)(x).size()\n #define mp make_pair\n #define pb push_back\n #define f first\n #define s second\n #define lb lower_bound\n #define ub upper_bound\n #define all(x) x.begin(), x.end()\n #define ins insert\n \n template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\n template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }\n  \n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n \n void __print(int x) {cerr << x;}\n void __print(long x) {cerr << x;}\n void __print(long long x) {cerr << x;}\n void __print(unsigned x) {cerr << x;}\n void __print(unsigned long x) {cerr << x;}\n void __print(unsigned long long x) {cerr << x;}\n void __print(float x) {cerr << x;}\n void __print(double x) {cerr << x;}\n void __print(long double x) {cerr << x;}\n void __print(char x) {cerr << '\'' << x << '\'';}\n void __print(const char *x) {cerr << '\ ' << x << '\ ';}\n void __print(const string &x) {cerr << '\ ' << x << '\ ';}\n void __print(bool x) {cerr << (x ?  true  :  false );}\n \n template<typename T, typename V>\n void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr <<  ,  ; __print(x.second); cerr << '}';}\n template<typename T>\n void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ?  ,   :   ), __print(i); cerr <<  } ;}\n void _print() {cerr <<  ]\n ;}\n template <typename T, typename... V>\n void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr <<  ,  ; _print(v...);}\n #ifdef DEBUG\n #define dbg(x...) cerr <<  \e[91m <<__func__<< : <<__LINE__<<  [  << #x <<  ] = [ ; _print(x); cerr <<  \e[39m  << endl;\n #else\n #define dbg(x...)\n #endif\n \n \n const int MOD = 1000000007;\n const char nl = '\n';\n const int MX = 200001; \n \n int dist[MX];\n int A[MX];\n set<pi> rem;\n pqg<pi> q;\n \n void add(int p, int pre, bool ty) {\n     auto it1 = rem.lb({p, -1});\n     if (it1 != rem.end()) {\n         int v = it1->s;\n         int d = max(pre, abs(A[v]-p));\n         if (ty) {\n             d = pre + abs(A[v]-p);\n         }\n         if (d < dist[v]) {\n             dist[v] = d;\n             q.push({d, v});\n         }\n     }\n     if (it1 != rem.begin()) {\n         it1--;\n         int v = it1->s;\n         int d = max(pre, abs(A[v]-p));\n         if (ty) {\n             d = pre + abs(A[v]-p);\n         }\n         if (d < dist[v]) {\n             dist[v] = d;\n             q.push({d, v});\n         }\n     }\n }\n \n void push(int p, int K) {\n     while (rem.lb({p, -1}) != rem.end() && rem.lb({p, -1})->f <= p+K) {\n         int x = rem.lb({p, -1})->s;\n         rem.erase({A[x], x});\n         q.push({K, x});\n         dist[x] = K;\n     }\n     auto it = rem.lb({p, -1});\n     while (it != rem.begin()) {\n         it--;\n         if (it->f < p-K) break;\n         int x = it->s;\n         rem.erase({A[x], x});\n         q.push({K, x});\n         dist[x] = K;\n         it = rem.lb({p, -1});\n     }\n }\n \n \n void solve() {\n     int N, Q; cin >> N >> Q;\n     F0R(i, N) dist[i] = 100000000;\n     int S; cin >> S; S--;\n     int D; cin >> D;\n     F0R(i, N) {\n         cin >> A[i];\n         if (i != S) rem.ins({A[i], i});\n     }\n     dist[S] = 0;\n     add(A[S]+D, 0, true);\n     add(A[S]-D, 0, true);\n     bool vis[MX]; F0R(i, N) vis[i] = false;\n     while (!q.empty()) {\n         int v = q.top().s;\n         int d = q.top().f;\n         q.pop();\n         if (vis[v]) continue;\n         vis[v] = true;\n         //dbg(v, d);\n         rem.erase({A[v], v});\n         add(A[v], d, true);\n         push(A[v]+D, d);\n         push(A[v]-D, d);\n         add(A[v]+D, 0, true);\n         add(A[v]-D, 0, true);\n     }\n     /*F0R(i, N) {\n         cout << dist[i] <<    ;\n     }\n     cout << nl;*/\n \n     while(Q--) {\n         int X, V; cin >> X >> V; X--;\n         cout << (dist[X]<=V? Yes : No ) << nl;\n     }\n }\n  \n int main() {\n     cin.tie(0)->sync_with_stdio(0); \n     cin.exceptions(cin.failbit);\n \n     int T = 1;\n //    cin >> T;\n     while(T--) {\n         solve();\n     }\n \n 	return 0;\n }\n \n \n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long k, b, n, t;\n int main() {\n   ios_base ::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> k >> b >> n >> t;\n   long long num = 1;\n   long long step = n;\n   while (t >= num) {\n     num = num * k + b;\n     step--;\n   }\n   if (step < 0) {\n     cout << 0;\n     return 0;\n   }\n   cout << step + 1;\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n const long double pi = 3.14159265359;\n const long long N = 1e9 + 7;\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m, arr[200005];\n   cin >> n >> m;\n   long long cntne = 0, cntpo = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n     if (arr[i] == -1)\n       cntne++;\n     else\n       cntpo++;\n   }\n   vector<long long> v;\n   for (int i = 0; i < m; i++) {\n     long long l, r;\n     cin >> l >> r;\n     r++;\n     long long ans = abs(l - r);\n     if ((ans % 2 == 0) && (cntne >= ans / 2) && (cntpo >= ans / 2))\n       v.push_back(1);\n     else\n       v.push_back(0);\n   }\n   for (int i = 0; i < ((long long)((v).size())); i++) cout << v[i] << endl;\n   return 0;\n }\n "}

cpp_dataset/train/train.jsonl

@@ -42,7 +42,6 @@
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 105;\n int l[M], r[M], t[M], c[M], res[M], p[M];\n int main() {\n   int n, m;\n   cin >> n >> m;\n   for (int i = 0; i < m; ++i) {\n     cin >> l[i] >> r[i] >> t[i] >> c[i];\n   }\n   for (int i = 1; i <= n; ++i) p[i] = INT_MAX;\n   for (int i = 0; i < m; ++i)\n     for (int j = l[i]; j <= r[i]; ++j)\n       if (t[i] < p[j]) p[j] = t[i], res[j] = i;\n   int sum = 0;\n   for (int i = 1; i <= n; ++i)\n     if (p[i] != INT_MAX) sum += c[res[i]];\n   cout << sum << endl;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long double EPS = 1e-9, pi = acos(-1);\n const long long N = 1e5 + 5;\n long long r[N], h[N], n, F[N], dp[N];\n bool cmp(pair<long long, long long> a, pair<long long, long long> b) {\n   if (a.first == b.first) {\n     return a.second < b.second;\n   } else\n     return a.first < b.first;\n }\n void add(long long d, long long id) {\n   while (id <= n) {\n     F[id] = max(F[id], d);\n     id += (id & -id);\n   }\n }\n long long get(long long i) {\n   long long res = 0;\n   while (i) {\n     res = max(res, F[i]);\n     i -= (i & -i);\n   }\n   return res;\n }\n signed main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> n;\n   for (long long i = 1; i <= n; ++i) cin >> r[i] >> h[i];\n   vector<pair<long long, long long> > A;\n   A.clear();\n   for (long long i = 1; i <= n; ++i) {\n     A.push_back({r[i] * r[i] * h[i], i});\n   }\n   sort(A.begin(), A.end(), cmp);\n   long long res = 0, id = 0, prev = A[0].first;\n   for (long long i = 0; i < n; ++i) {\n     if (prev != A[i].first) {\n       while (id < i) {\n         add(dp[id], A[id].second);\n         id++;\n       }\n     }\n     dp[i] = get(A[i].second) + A[i].first;\n     res = max(res, dp[i]);\n     prev = A[i].first;\n   }\n   cout << fixed << setprecision(9) << pi * res << endl;\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int t;\n   cin >> t;\n   string str;\n   for (int i = 0; i < t; i++) {\n     cin >> str;\n     long long int res = 0;\n     long long int arr[str.size()];\n     if (str[0] == '+') {\n       arr[0] = 1;\n     } else {\n       arr[0] = -1;\n     }\n     for (int j = 1; j < str.size(); j++) {\n       if (str[j] == '+') {\n         arr[j] = arr[j - 1] + 1;\n       } else {\n         arr[j] = arr[j - 1] - 1;\n       }\n     }\n     int x = -1;\n     for (int j = 0; j < str.size(); j++) {\n       if (arr[j] == x) {\n         res = res + j + 1;\n         x--;\n       }\n     }\n     res = res + str.size();\n     cout << res << endl;\n   }\n   return 0;\n }\n "}
-{"func_code_string": "#include <bits/stdc++.h>\n template <typename T>\n void MACRO_VAR_Scan(T& t) {\n   std::cin >> t;\n }\n template <typename First, typename... Rest>\n void MACRO_VAR_Scan(First& first, Rest&... rest) {\n   std::cin >> first;\n   MACRO_VAR_Scan(rest...);\n }\n template <typename T>\n void MACRO_VEC_ROW_Init(int n, T& t) {\n   t.resize(n);\n }\n template <typename First, typename... Rest>\n void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {\n   first.resize(n);\n   MACRO_VEC_ROW_Init(n, rest...);\n }\n template <typename T>\n void MACRO_VEC_ROW_Scan(int p, T& t) {\n   std::cin >> t[p];\n }\n template <typename First, typename... Rest>\n void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {\n   std::cin >> first[p];\n   MACRO_VEC_ROW_Scan(p, rest...);\n }\n template <typename T>\n inline T CHMAX(T& a, const T b) {\n   return a = (a < b) ? b : a;\n }\n template <typename T>\n inline T CHMIN(T& a, const T b) {\n   return a = (a > b) ? b : a;\n }\n void CHECKTIME(std::function<void()> f) {\n   auto start = std::chrono::system_clock::now();\n   f();\n   auto end = std::chrono::system_clock::now();\n   auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start))\n                  .count();\n   std::cerr <<  [Time:  << res <<  ns  (  << res / (1.0e9) <<  s)]\n ;\n }\n template <class T>\n std::vector<std::vector<T>> VV(int n, int m, T init = T()) {\n   return std::vector<std::vector<T>>(n, std::vector<T>(m, init));\n }\n template <typename S, typename T>\n std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\n   os <<  (  << p.first <<  ,   << p.second <<  ) ;\n   return os;\n }\n using ll = long long;\n using ull = unsigned long long;\n using ld = long double;\n using PAIR = std::pair<ll, ll>;\n using PAIRLL = std::pair<ll, ll>;\n constexpr ll INFINT = 1 << 30;\n constexpr ll INFINT_LIM = (1LL << 31) - 1;\n constexpr ll INFLL = 1LL << 60;\n constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);\n constexpr double EPS = 1e-9;\n constexpr ll MOD = 1000000007;\n constexpr double PI = 3.141592653589793238462643383279;\n template <class T, size_t N>\n void FILL(T (&a)[N], const T& val) {\n   for (auto& x : a) x = val;\n }\n template <class ARY, size_t N, size_t M, class T>\n void FILL(ARY (&a)[N][M], const T& val) {\n   for (auto& b : a) FILL(b, val);\n }\n template <class T>\n void FILL(std::vector<T>& a, const T& val) {\n   for (auto& x : a) x = val;\n }\n template <class ARY, class T>\n void FILL(std::vector<std::vector<ARY>>& a, const T& val) {\n   for (auto& b : a) FILL(b, val);\n }\n namespace FFT {\n const double pi = std::acos(-1);\n std::vector<std::complex<double>> tmp;\n size_t sz = 1;\n std::vector<std::complex<double>> fft(std::vector<std::complex<double>> a,\n                                       bool inv = false) {\n   size_t mask = sz - 1;\n   size_t p = 0;\n   for (size_t i = sz >> 1; i >= 1; i >>= 1) {\n     auto& cur = (p & 1) ? tmp : a;\n     auto& nex = (p & 1) ? a : tmp;\n     std::complex<double> e = std::polar(1., 2 * pi * i * (inv ? -1 : 1) / sz);\n     std::complex<double> w = 1;\n     for (size_t j = 0; j < sz; j += i) {\n       for (size_t k = 0; k < i; ++k) {\n         nex[j + k] =\n             cur[((j << 1) & mask) + k] + w * cur[(((j << 1) + i) & mask) + k];\n       }\n       w *= e;\n     }\n     ++p;\n   }\n   if (p & 1) std::swap(a, tmp);\n   if (inv)\n     for (size_t i = 0; i < sz; ++i) a[i] /= sz;\n   return a;\n }\n std::vector<ll> mul(std::vector<ll> a, std::vector<ll> b) {\n   size_t m = a.size() + b.size() - 1;\n   sz = 1;\n   while (m > sz) sz <<= 1;\n   tmp.resize(sz);\n   std::vector<std::complex<double>> A(sz), B(sz);\n   for (size_t i = 0; i < a.size(); ++i) A[i].real(a[i]);\n   for (size_t i = 0; i < b.size(); ++i) B[i].real(b[i]);\n   A = fft(A);\n   B = fft(B);\n   for (size_t i = 0; i < sz; ++i) A[i] *= B[i];\n   A = fft(A, true);\n   a.resize(m);\n   for (size_t i = 0; i < m; ++i) a[i] = std::round(A[i].real());\n   return a;\n }\n };  // namespace FFT\n signed main() {\n   std::ios::sync_with_stdio(false);\n   std::cin.tie(0);\n   ;\n   ll n, x;\n   MACRO_VAR_Scan(n, x);\n   ;\n   std::vector<ll> a(n);\n   for (auto& i : a) std::cin >> i;\n   ;\n   for (ll i = 0; i < ll(n); ++i) a[i] = a[i] < x;\n   std::vector<ll> b;\n   {\n     ll cnt = 0;\n     for (ll i = 0; i < ll(n + 1); ++i) {\n       if (i == n || a[i]) {\n         b.emplace_back(cnt);\n         cnt = 0;\n       } else {\n         ++cnt;\n       }\n     }\n   }\n   ll m = b.size();\n   {\n     ll ans = 0;\n     for (ll i = 0; i < ll(m); ++i) {\n       ans += (ll)b[i] * (b[i] + 1) / 2;\n     }\n     std::cout << (ans);\n     ;\n   }\n   {\n     for (ll i = 0; i < ll(m); ++i) ++b[i];\n     auto bb(b);\n     std::reverse((bb).begin(), (bb).end());\n     auto c = FFT::mul(b, bb);\n     std::vector<ll> ans(n, 0);\n     ll p = 0;\n     for (ll i = ll(m - 1) - 1; i >= 0; --i) {\n       ans[p++] = c[i];\n     }\n     for (ll i = 0; i < ll(n); ++i) {\n       std::cout <<    ;\n       std::cout << (ans[i]);\n       ;\n     }\n     std::cout <<  \n ;\n     ;\n   }\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n int main() {\n   int n, k;\n   cin >> n >> k;\n   for (int i = 0; i < k; i++) {\n     if (n % 10 != 0) {\n       n = n - 1;\n     } else if (n % 10 == 0) {\n       n = n / 10;\n     }\n   }\n   cout << n;\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int N = 5e5 + 100;\n template <class nmsl>\n inline void read(nmsl &x) {\n   x = 0;\n   char ch = getchar(), w = 0;\n   while (!isdigit(ch)) w = (ch == '-'), ch = getchar();\n   while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();\n   x = w ? -x : x;\n }\n long long n, f[N], size[N], root[N], hd[N], bianshu, ans;\n struct abc {\n   int nxt, to;\n } qwq[N * 2];\n inline void addedg(int lai, int qu) {\n   qwq[++bianshu].nxt = hd[lai];\n   qwq[bianshu].to = qu;\n   hd[lai] = bianshu;\n }\n inline void first_dp(int u, int father) {\n   size[u] = 1;\n   for (register int i = hd[u]; i; i = qwq[i].nxt) {\n     int v = qwq[i].to;\n     if (v == father) continue;\n     first_dp(v, u);\n     size[u] += size[v];\n     f[u] += f[v];\n   }\n   f[u] += size[u];\n   return;\n }\n inline void dp(int u, int father) {\n   f[u] = 0;\n   for (register int i = hd[u]; i; i = qwq[i].nxt) {\n     int v = qwq[i].to;\n     f[u] += f[v];\n   }\n   long long tot = f[u] + n;\n   ans = max(ans, tot);\n   for (register int i = hd[u]; i; i = qwq[i].nxt) {\n     int v = qwq[i].to;\n     if (v == father) continue;\n     size[u] = n - size[v];\n     f[u] = tot - f[v] - size[v];\n     dp(v, u);\n   }\n }\n int main() {\n   read(n);\n   for (register int i = 1, qa, qb; i < n; i++)\n     read(qa), read(qb), addedg(qa, qb), addedg(qb, qa);\n   first_dp(1, 0);\n   ans = f[1];\n   dp(1, 0);\n   cout << ans;\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int M = 3000;\n int n, m;\n pair<pair<int, int>, int> v[M];\n map<pair<pair<int, int>, int>, vector<pair<pair<int, int>, int> > > Q;\n int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }\n pair<pair<int, int>, int> get(int x1, int y1, int x2, int y2) {\n   int x = x2 - x1, y = y2 - y1;\n   if (x == 0)\n     y = 1;\n   else if (y == 0)\n     x = 1;\n   else {\n     int d = gcd(x, y);\n     x /= d, y /= d;\n   }\n   if (x < 0) x = -x, y = -y;\n   return make_pair(make_pair(x, y), y1 * x - x1 * y);\n }\n int sign(double x) {\n   if (fabs(x) < 1E-6) return 0;\n   return (x > 0) ? 1 : -1;\n }\n double dist(int x1, int y1, int x2, int y2) {\n   return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n }\n bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {\n   if (a.first != b.first) return a.first < b.first;\n   return a.second > b.second;\n }\n int main() {\n   Q.clear();\n   scanf( %d%d , &n, &m);\n   for (int i = 0; i < (n); i++) {\n     int x1, y1, x2, y2;\n     scanf( %d%d%d%d , &x1, &y1, &x2, &y2);\n     x1 *= 2, y1 *= 2, x2 *= 2, y2 *= 2;\n     if (make_pair(x1, y1) > make_pair(x2, y2)) {\n       swap(x1, x2);\n       swap(y1, y2);\n     }\n     pair<pair<int, int>, int> tmp = get(x1, y1, x2, y2);\n     Q[tmp].push_back(make_pair(make_pair(x1, y1), 1));\n     Q[tmp].push_back(make_pair(make_pair(x2, y2), -1));\n   }\n   for (int i = 0; i < (m); i++) {\n     scanf( %d%d%d , &v[i].first.first, &v[i].first.second, &v[i].second);\n     for (int j = 0; j < (i); j++) {\n       if (v[i].second != v[j].second) continue;\n       int x1 = v[i].first.first, y1 = v[i].first.second, r = v[i].second;\n       int x2 = v[j].first.first, y2 = v[j].first.second;\n       if (sign(2 * r - dist(x1, y1, x2, y2)) >= 0) continue;\n       int x0 = x1 + x2, y0 = y1 + y2;\n       int x = x2 * 2 - x0, y = y2 * 2 - y0;\n       pair<pair<int, int>, int> tmp = get(x0, y0, x0 - y, y0 + x);\n       if (Q.find(tmp) == Q.end()) continue;\n       Q[tmp].push_back(make_pair(make_pair(x0, y0), 0));\n     }\n   }\n   int ret = 0;\n   for (__typeof(Q.begin()) it = Q.begin(); it != Q.end(); it++) {\n     sort(it->second.begin(), it->second.end(), cmp);\n     int now = 0;\n     for (__typeof(it->second.begin()) t = it->second.begin();\n          t != it->second.end(); t++) {\n       if (t->second == 0) ret += now;\n       now += t->second;\n     }\n   }\n   printf( %d\n , ret);\n   return 0;\n }\n "}

cpp_dataset/validation/validation.jsonl

@@ -51,7 +51,6 @@
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long mp[1005][1005];\n long long n, a, b;\n void output() {\n   for (long long i = 1; i <= n; i++) {\n     for (long long j = 1; j <= n; j++) {\n       if (i == j)\n         printf( 0 );\n       else\n         printf( %lld , a < b ? !mp[i][j] : mp[i][j]);\n     }\n     printf( \n );\n   }\n }\n int main() {\n   scanf( %lld%lld%lld , &n, &a, &b);\n   long long root = 2;\n   if ((a != 1 && b != 1)) {\n     printf( NO\n );\n     return 0;\n   }\n   if (n == 2 && a == 1 && b == 1) {\n     printf( NO\n );\n     return 0;\n   }\n   if (n == 3 && a == 1 && b == 1) {\n     printf( NO\n );\n     return 0;\n   }\n   printf( YES\n );\n   if (a == 1 && b == 1)\n     for (long long i = 1; i < n; i++) mp[i][i + 1] = mp[i + 1][i] = true;\n   else\n     for (long long i = 0; i < n - max(a, b); i++, root++)\n       mp[1][root] = mp[root][1] = true;\n   output();\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long power(long long a, long long b) {\n   long long ans = 1;\n   while (b > 0) {\n     if (b % 2 != 0) {\n       ans = (ans * a) % 1000000007;\n     }\n     a = ((a % 1000000007) * (a % 1000000007)) % 1000000007;\n     b >>= 1;\n   }\n   return ans;\n }\n void sieve(int n) {\n   bool prime[n + 1];\n   memset(prime, true, sizeof(prime));\n   for (int p = 2; p * p <= n; p++) {\n     if (prime[p]) {\n       for (int i = p * p; i <= n; i += p) prime[i] = false;\n     }\n   }\n   for (int p = 2; p <= n; p++) {\n     if (prime[p]) cout << p <<    ;\n   }\n }\n int main() {\n   std::ios::sync_with_stdio(false);\n   cin.tie(NULL);\n   cout.tie(NULL);\n   ;\n   int t = 1;\n   cin >> t;\n   while (t--) {\n     int n, k;\n     cin >> n >> k;\n     vector<vector<int>> v;\n     for (int i = 0; i < k; i++) {\n       int c;\n       cin >> c;\n       vector<int> temp;\n       for (int j = 0; j < c; j++) {\n         int z;\n         cin >> z;\n         temp.push_back(z);\n       }\n       v.push_back(temp);\n     }\n     int l = 1, h = n;\n     int ma;\n     cout <<  ? \n          <<     << n <<    ;\n     for (int i = 1; i <= n; i++) cout << i <<    ;\n     cout << endl;\n     cin >> ma;\n     for (int i = 0; i < 10; i++) {\n       int mid = (h + l) / 2;\n       int temp;\n       cout <<  ? \n            <<     << mid - l + 1 <<    ;\n       for (int kha = l; kha <= mid; kha++) cout << kha <<    ;\n       cout << endl;\n       cin >> temp;\n       if (temp == ma)\n         h = mid;\n       else\n         l = mid;\n     }\n     int ind = h;\n     bool flag = false;\n     vector<int> ans;\n     for (int i = 0; i < v.size(); i++) {\n       sort(v[i].begin(), v[i].end());\n       for (int j = 0; j < v[i].size(); j++) {\n         if (v[i][j] == ind) {\n           flag = true;\n           cout <<  ? \n                <<    ;\n           vector<int> loa;\n           for (int lo = 1; lo <= n; lo++) {\n             if (binary_search(v[i].begin(), v[i].end(), lo) == false) {\n               loa.push_back(lo);\n             }\n           }\n           cout << loa.size() <<    ;\n           for (auto lo : loa) cout << lo <<    ;\n           cout << endl;\n           int kha;\n           cin >> kha;\n           ans.push_back(kha);\n         }\n       }\n       if (flag == false) {\n         ans.push_back(ma);\n       } else {\n         flag = false;\n       }\n     }\n     cout <<  ! \n          <<    ;\n     for (auto i : ans) cout << i <<    ;\n     cout << endl;\n     string sa;\n     cin >> sa;\n     if (sa ==  Correct ) {\n       continue;\n     } else {\n       return 0;\n     }\n   }\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e18;\n const int maxn = 2e6 + 10;\n int a[maxn], cnt[maxn];\n long long sum[maxn];\n int main(void) {\n   int n, x, y;\n   scanf( %d %d %d , &n, &x, &y);\n   int z = x / y;\n   for (int i = 1; i <= n; i++)\n     scanf( %d , a + i), cnt[a[i]]++, sum[a[i]] += a[i];\n   for (int i = 1; i <= 2000000; i++) cnt[i] += cnt[i - 1], sum[i] += sum[i - 1];\n   long long ans = INF;\n   for (int i = 2; i <= 1000000; i++) {\n     long long tmp = 0;\n     int zz = min(z, i - 1);\n     for (int j = 1; (j - 1) * i < 1000000; j++) {\n       if (i - zz - 2 >= 0)\n         tmp += (long long)(cnt[j * i - zz - 1] - cnt[j * i - i]) * x;\n       if (zz)\n         tmp += ((long long)i * j * (cnt[j * i - 1] - cnt[j * i - zz - 1]) -\n                 (sum[j * i - 1] - sum[j * i - zz - 1])) *\n                y;\n     }\n     ans = min(ans, tmp);\n   }\n   printf( %I64d\n , ans);\n   return 0;\n }\n "}
-{"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int md = 1e9 + 7;\n int n;\n char s[111];\n int f[111][3333];\n int main() {\n   int t;\n   f[0][0] = 1;\n   for (int i = 1; i <= 100; ++i) {\n     for (int j = 0; j <= 3000; ++j) {\n       for (int c = 0; c <= min(j, 25); ++c) {\n         f[i][j] += f[i - 1][j - c];\n         f[i][j] %= md;\n       }\n     }\n   }\n   scanf( %d , &t);\n   while (t--) {\n     scanf( %s , s);\n     int sum = 0;\n     for (int i = 0; i < strlen(s); ++i) sum += s[i] - 'a';\n     printf( %d\n , (f[strlen(s)][sum] + md - 1) % md);\n   }\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize ( O3 )\n #pragma GCC target ( sse4 )\n  \n using namespace std;\n  \n typedef long long ll;\n typedef long double ld;\n typedef complex<ld> cd;\n  \n typedef pair<int, int> pi;\n typedef pair<ll,ll> pl;\n typedef pair<ld,ld> pd;\n  \n typedef vector<int> vi;\n typedef vector<ld> vd;\n typedef vector<ll> vl;\n typedef vector<pi> vpi;\n typedef vector<pl> vpl;\n typedef vector<cd> vcd;\n \n template<class T> using pq = priority_queue<T>;\n template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n  \n #define FOR(i, a, b) for (int i=a; i<(b); i++)\n #define F0R(i, a) for (int i=0; i<(a); i++)\n #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)\n #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)\n #define trav(a,x) for (auto& a : x)\n #define uid(a, b) uniform_int_distribution<int>(a, b)(rng)\n  \n #define sz(x) (int)(x).size()\n #define mp make_pair\n #define pb push_back\n #define f first\n #define s second\n #define lb lower_bound\n #define ub upper_bound\n #define all(x) x.begin(), x.end()\n #define ins insert\n \n template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\n template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }\n  \n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n \n void __print(int x) {cerr << x;}\n void __print(long x) {cerr << x;}\n void __print(long long x) {cerr << x;}\n void __print(unsigned x) {cerr << x;}\n void __print(unsigned long x) {cerr << x;}\n void __print(unsigned long long x) {cerr << x;}\n void __print(float x) {cerr << x;}\n void __print(double x) {cerr << x;}\n void __print(long double x) {cerr << x;}\n void __print(char x) {cerr << '\'' << x << '\'';}\n void __print(const char *x) {cerr << '\ ' << x << '\ ';}\n void __print(const string &x) {cerr << '\ ' << x << '\ ';}\n void __print(bool x) {cerr << (x ?  true  :  false );}\n \n template<typename T, typename V>\n void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr <<  ,  ; __print(x.second); cerr << '}';}\n template<typename T>\n void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ?  ,   :   ), __print(i); cerr <<  } ;}\n void _print() {cerr <<  ]\n ;}\n template <typename T, typename... V>\n void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr <<  ,  ; _print(v...);}\n #ifdef DEBUG\n #define dbg(x...) cerr <<  \e[91m <<__func__<< : <<__LINE__<<  [  << #x <<  ] = [ ; _print(x); cerr <<  \e[39m  << endl;\n #else\n #define dbg(x...)\n #endif\n \n \n const int MOD = 1000000007;\n const char nl = '\n';\n const int MX = 200001; \n \n int dist[MX];\n int A[MX];\n set<pi> rem;\n pqg<pi> q;\n \n void add(int p, int pre, bool ty) {\n     auto it1 = rem.lb({p, -1});\n     if (it1 != rem.end()) {\n         int v = it1->s;\n         int d = max(pre, abs(A[v]-p));\n         if (ty) {\n             d = pre + abs(A[v]-p);\n         }\n         if (d < dist[v]) {\n             dist[v] = d;\n             q.push({d, v});\n         }\n     }\n     if (it1 != rem.begin()) {\n         it1--;\n         int v = it1->s;\n         int d = max(pre, abs(A[v]-p));\n         if (ty) {\n             d = pre + abs(A[v]-p);\n         }\n         if (d < dist[v]) {\n             dist[v] = d;\n             q.push({d, v});\n         }\n     }\n }\n \n void push(int p, int K) {\n     while (rem.lb({p, -1}) != rem.end() && rem.lb({p, -1})->f <= p+K) {\n         int x = rem.lb({p, -1})->s;\n         rem.erase({A[x], x});\n         q.push({K, x});\n         dist[x] = K;\n     }\n     auto it = rem.lb({p, -1});\n     while (it != rem.begin()) {\n         it--;\n         if (it->f < p-K) break;\n         int x = it->s;\n         rem.erase({A[x], x});\n         q.push({K, x});\n         dist[x] = K;\n         it = rem.lb({p, -1});\n     }\n }\n \n \n void solve() {\n     int N, Q; cin >> N >> Q;\n     F0R(i, N) dist[i] = 100000000;\n     int S; cin >> S; S--;\n     int D; cin >> D;\n     F0R(i, N) {\n         cin >> A[i];\n         if (i != S) rem.ins({A[i], i});\n     }\n     dist[S] = 0;\n     add(A[S]+D, 0, true);\n     add(A[S]-D, 0, true);\n     bool vis[MX]; F0R(i, N) vis[i] = false;\n     while (!q.empty()) {\n         int v = q.top().s;\n         int d = q.top().f;\n         q.pop();\n         if (vis[v]) continue;\n         vis[v] = true;\n         //dbg(v, d);\n         rem.erase({A[v], v});\n         add(A[v], d, true);\n         push(A[v]+D, d);\n         push(A[v]-D, d);\n         add(A[v]+D, 0, true);\n         add(A[v]-D, 0, true);\n     }\n     /*F0R(i, N) {\n         cout << dist[i] <<    ;\n     }\n     cout << nl;*/\n \n     while(Q--) {\n         int X, V; cin >> X >> V; X--;\n         cout << (dist[X]<=V? Yes : No ) << nl;\n     }\n }\n  \n int main() {\n     cin.tie(0)->sync_with_stdio(0); \n     cin.exceptions(cin.failbit);\n \n     int T = 1;\n //    cin >> T;\n     while(T--) {\n         solve();\n     }\n \n 	return 0;\n }\n \n \n "}
 {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long k, b, n, t;\n int main() {\n   ios_base ::sync_with_stdio(0);\n   cin.tie(0);\n   cin >> k >> b >> n >> t;\n   long long num = 1;\n   long long step = n;\n   while (t >= num) {\n     num = num * k + b;\n     step--;\n   }\n   if (step < 0) {\n     cout << 0;\n     return 0;\n   }\n   cout << step + 1;\n   return 0;\n }\n "}
 {"func_code_string": "#include <bits/stdc++.h>\n const long double pi = 3.14159265359;\n const long long N = 1e9 + 7;\n using namespace std;\n int main() {\n   ios_base::sync_with_stdio(0);\n   cin.tie(0);\n   cout.tie(0);\n   long long n, m, arr[200005];\n   cin >> n >> m;\n   long long cntne = 0, cntpo = 0;\n   for (int i = 0; i < n; i++) {\n     cin >> arr[i];\n     if (arr[i] == -1)\n       cntne++;\n     else\n       cntpo++;\n   }\n   vector<long long> v;\n   for (int i = 0; i < m; i++) {\n     long long l, r;\n     cin >> l >> r;\n     r++;\n     long long ans = abs(l - r);\n     if ((ans % 2 == 0) && (cntne >= ans / 2) && (cntpo >= ans / 2))\n       v.push_back(1);\n     else\n       v.push_back(0);\n   }\n   for (int i = 0; i < ((long long)((v).size())); i++) cout << v[i] << endl;\n   return 0;\n }\n "}