oj.uz

답안 #857954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857954 2023-10-07T07:56:14 Z danikoynov Newspapers (CEOI21_newspapers) C++14
6 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
}

int n, m;
void solve()
{
    cin >> n >> m;
    if (n == 1)
    {
        cout << "YES" << endl;
        cout << 1 << endl;
        cout << 1 << endl;
        return;
    }
    cout << "YES" << endl;
    if (n % 2 == 1)
    {
    cout << 2 * n << endl;
    for (int i = 1; i <= n; i ++)
        cout << i << " ";
    for (int i = 1; i <= n; i ++)
        cout << i << " ";
    cout << endl;
    }
    else
    {
    cout << 2 * n + 1<< endl;
    for (int i = 1; i <= n; i ++)
        cout << i << " ";
        cout << 1 << " ";
    for (int i = 1; i <= n; i ++)
        cout << i << " ";
    cout << endl;
    }
}
int main()
{
    solve();
    return 0;
}

Compilation message

newspapers.cpp: In function 'void solve()':
newspapers.cpp:38:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   38 |     for (int i = 1; i <= n; i ++)
      |     ^~~
newspapers.cpp:40:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   40 |         cout << 1 << " ";
      |         ^~~~

Subtask #1
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
6.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
3 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
7 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
8 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
9 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
10 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
11 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
12 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
13 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
14 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
16 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
17 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
18 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
19 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
20 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -