oj.uz

Submission #1058606

# Submission time Handle Problem Language Result Execution time Memory
1058606 2024-08-14T11:28:31 Z user736482 Make them Meet (EGOI24_makethemmeet) C++17
0 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,t,n,x,y,m;
vector<int>v1,v2;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    for(int i=0;i<n;i++){
        v1.push_back(i/2);
        v2.push_back((i+1)/2);
    }
    for(int i=0;i<600;i++){
        if(i&1)
            for(int i=0;i<v1.size();i++)
                cout<<v1[i]<<" ";
        else
            for(int i=0;i<v2.size();i++)
                cout<<v2[i]<<" ";
        cout<<"\n";
    }
    return 0;
}

Compilation message

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

Subtask #1
0.0 / 10.0

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

Subtask #2
0.0 / 13.0

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

Subtask #3
0.0 / 11.0

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

Subtask #4
0.0 / 36.0

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

Subtask #5
0.0 / 30.0

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