oj.uz

답안 #223134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223134 2020-04-14T22:41:31 Z Haunted_Cpp Esej (COCI15_esej) C++17
40 / 80
 31 ms 1912 KB 
#include <bits/stdc++.h> 
 
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

string solve () {
  string w;
  for (int i = 0; i < 15; i++) {
    int n  = uniform_int_distribution<int> (0, 25) (rng);
    w += char ('a' + n);
  }
  return w;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int a, b;
  cin >> a >> b;
  while (a--) {
    cout << solve () << ' ';
  }
  return 0;
}

Subtask #1
40.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Incorrect 4 ms 384 KB Output isn't correct
5 Correct 6 ms 512 KB Output is correct
6 Incorrect 7 ms 512 KB Output isn't correct
7 Incorrect 7 ms 512 KB Output isn't correct
8 Correct 27 ms 1712 KB Output is correct
9 Correct 31 ms 1912 KB Output is correct
10 Incorrect 5 ms 384 KB Output isn't correct