oj.uz

Submission #827308

# Submission time Handle Problem Language Result Execution time Memory
827308 2023-08-16T10:49:44 Z Farhan_HY Newspapers (CEOI21_newspapers) C++17
6 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0);
using namespace std;
const int inf = 1e18;
const int N = 1e5 + 5;
const int M = 500;
const int LOG = 32;
const int CHAR = 26;
const int mod = 1e9 + 7;
const int mod2 = 998244353;
const float pi = atan(1) * 4;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, 1, -1};

main() {
	IOS
	int n;
	cin >> n;
	cout << "YES\n";
	cout << 2 * n << '\n';
	for(int i = 1; i <= n; i++) cout << i << " ";
	for(int i = n; i; i--) cout << i << " ";
}

Compilation message

newspapers.cpp:19:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   19 | main() {
      | ^~~~

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
6.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
7 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
8 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
9 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
10 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
11 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
12 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
13 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
14 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
16 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
17 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
18 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
19 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
20 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -