oj.uz

Submission #1058660

# Submission time Handle Problem Language Result Execution time Memory
1058660 2024-08-14T11:53:46 Z user736482 Make them Meet (EGOI24_makethemmeet) C++17
34 / 100
 3 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,t,n,x,y,m;
vector<int>v1,v2,v3;
bool ifstar=1;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>a>>b;
        if(a!=0 || b!=i+1)
            ifstar=0;}
    if(!ifstar){
    for(int i=0;i<n;i++){
        v1.push_back(i/2);
        v2.push_back((i+1)/2);
    }
    cout<<600<<"\n";
    for(int i=0;i<600;i++){
        if(i&1)
            for(int j=0;j<v1.size();j++)
                cout<<v1[j]<<" ";
        else
            for(int j=0;j<v2.size();j++)
                cout<<v2[j]<<" ";
        cout<<"\n";
    }}
    else{
        for(int i=0;i<n;i++)
            v3.push_back(i);
        cout<<2*n-2+1<<"\n";
        for(int i=0;i<n;i++)
            cout<<0<<" ";
        cout<<"\n";
        for(int i=1;i<n;i++){
            for(int j=0;j<n;j++){
                if(j==i)
                    cout<<0<<" ";
                else
                    cout<<v3[j]<<" ";
            }
            cout<<"\n";
            for(int j=0;j<n;j++){
                if(j==i)
                    cout<<0<<" ";
                else
                    cout<<v3[j]<<" ";
            }
            cout<<"\n";
        }
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:23:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |             for(int j=0;j<v1.size();j++)
      |                         ~^~~~~~~~~~
Main.cpp:26:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |             for(int j=0;j<v2.size();j++)
      |                         ~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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
13.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 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 600 KB Output is correct

Subtask #3
11.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 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 348 KB Output is correct

Subtask #4
0.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 2 ms 456 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 3 ms 516 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Incorrect 0 ms 348 KB If people start at 0 and 4, then they can avoid each other
25 Halted 0 ms 0 KB -

Subtask #5
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 2 ms 456 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 3 ms 516 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Incorrect 0 ms 348 KB If people start at 0 and 4, then they can avoid each other
34 Halted 0 ms 0 KB -