Submission #15050912


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
using vs = vector<string>;
using vb = vector<bool>;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n) - 1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REPS(c, s) for (char c : s)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REV(c) reverse(ALL(c))
#define sz(v) (int)v.size()
#define endl '\n'
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
template<class T> inline void prn(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << ' ';}
template<class T> inline void printv(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << (i == n - 1 ? endl : ' ');}
template<class T> inline void printvv(vector<vector<T>>& v) {for (auto u : v) printv(u);}
template<class T> inline void printlnv(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << endl;}
const int MOD = 1000000007;
const int INF = 1000000001;
const ll LINF = 1000000001000000001LL;
 
void solve();
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(numeric_limits<double>::max_digits10);
    solve();
    return 0;
}

void solve() {
    cout << 300 << endl;
    REP1(i, 50) REP1(j, 48) cout << i << " " << j << endl;
}

Submission Info

Submission Time
Task A - Multiple Pieces
User mdstoy
Language C++ (GCC 9.2.1)
Score 49322
Code Size 1773 Byte
Status
Exec Time 10 ms
Memory 3648 KB

Judge Result

Set Name Score / Max Score Test Cases
test_01 4942 / 1343058 subtask_01_01.txt
test_02 3392 / 1343058 subtask_01_02.txt
test_03 5288 / 1343058 subtask_01_03.txt
test_04 5309 / 1343058 subtask_01_04.txt
test_05 5133 / 1343058 subtask_01_05.txt
test_06 5776 / 1343058 subtask_01_06.txt
test_07 4593 / 1343058 subtask_01_07.txt
test_08 3890 / 1343058 subtask_01_08.txt
test_09 6085 / 1343058 subtask_01_09.txt
test_10 4914 / 1343058 subtask_01_10.txt
Case Name Status Exec Time Memory
subtask_01_01.txt 10 ms 3512 KB
subtask_01_02.txt 2 ms 3636 KB
subtask_01_03.txt 4 ms 3472 KB
subtask_01_04.txt 2 ms 3544 KB
subtask_01_05.txt 3 ms 3584 KB
subtask_01_06.txt 2 ms 3464 KB
subtask_01_07.txt 3 ms 3648 KB
subtask_01_08.txt 3 ms 3584 KB
subtask_01_09.txt 2 ms 3636 KB
subtask_01_10.txt 2 ms 3640 KB