답안 #381977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381977	2021-03-26T08:22:05 Z	topovik	Hop (COCI21_hop)	C++14	110 / 110	68 ms	1448 KB

Main

#include <bits/stdc++.h>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define f first
#define s second
#define pb push_back
//#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
#define vi vector<int>
#define pb push_back
#define len(x) (int)x.size()
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = 1e3 + 10;


namespace RANDOM
{
    ll Time()
    {
        return chrono::system_clock().now().time_since_epoch().count();
    }
    mt19937 rnd(Time());
}
using namespace RANDOM;

int main()
{
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = 0; j <= i; j++) cout << (rnd() % 3 + 1) << " ";
        cout << endl;
    }
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct

Subtask #2

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	68 ms	1388 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	46 ms	1132 KB	Output is correct
12	Correct	58 ms	1448 KB	Output is correct
13	Correct	48 ms	1260 KB	Output is correct
14	Correct	4 ms	364 KB	Output is correct
15	Correct	47 ms	1260 KB	Output is correct
16	Correct	50 ms	1260 KB	Output is correct
17	Correct	62 ms	1260 KB	Output is correct
18	Correct	48 ms	1260 KB	Output is correct
19	Correct	51 ms	1260 KB	Output is correct
20	Correct	48 ms	1260 KB	Output is correct
21	Correct	56 ms	1260 KB	Output is correct
22	Correct	48 ms	1260 KB	Output is correct
23	Correct	55 ms	1388 KB	Output is correct