oj.uz

Submission #1058624

# Submission time Handle Problem Language Result Execution time Memory
1058624 2024-08-14T11:35:37 Z Szymon_Pilipczuk Make them Meet (EGOI24_makethemmeet) C++17
10 / 100
 1 ms 348 KB 
#include <iostream>
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    int a,b;
    int type = 0;
    for(int i =0;i<m;i++)
    {
        cin>>a>>b;
        if (min(a,b) > 0)
        {
            type = 1;
        }
    }
    if (type == 0)
    {


        cout<<2*n-1<<"\n";
        for(int i = 1;i<n;i++)
        {
            for(int q = 0;q<2;q++)
            {
                for(int j = 0;j<n;j++)
                {
                    if(j == i)
                    {
                        cout<<0<<" ";
                    }
                    else
                    {
                        cout<<j<<" ";
                    }
                }
            cout<<"\n";
            }

        }
        for(int i = 0;i<n;i++)
        {
            cout<<0<<" ";
        }
    }
    else
    {
        cout<<2*n-2<<"\n";
        for(int i = 0;i<n-1;i++)
        {
            for(int j = 0;j<n;j++)
            {
                cout<<j/2+i%2*j%2<<" ";
            }
            cout<<"\n";
        }
        for(int i = 0;i<n-1;i++)
        {
            for(int j = 0;j<n;j++)
            {
                if(i == j)
                {
                     cout<<j+1<<" ";
                }
                else
                {
                    cout<<j<<" ";
                }
            }
            cout<<"\n";
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB If people start at 1 and 2, then they can avoid each other
4 Halted 0 ms 0 KB -

Subtask #3
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB If people start at 1 and 2, then they can avoid each other
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB If people start at 1 and 2, then they can avoid each other
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB If people start at 1 and 2, then they can avoid each other
9 Halted 0 ms 0 KB -