oj.uz

답안 #667593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667593 2022-12-01T18:30:58 Z berr Roads (CEOI20_roads) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+37;
//1.st subtask all are vertical

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; cin>>n;
    vector<array<int, 2>> node(2*n+1);

    vector<array<int, 3>> q;

    for(int i=1; i<=n*2; i+=2)
    {
        cin>>node[i][0]>>node[i][1];
        cin>>node[i+1][0]>>node[i+1][1];

        array<int, 2> a=node[i];
        array<int, 2> b=node[i+1];



        if(b<a)
        {
            q.push_back({node[i+1][0], node[i+1][1], i+1});
        }
        else
        {
            q.push_back({node[i][0], node[i][1], i});
        }

    }

    sort(q.begin(), q.end());

    for(int i=0; i<q.size()-1; i++)
    {
        int v=q[i][2];
        int u=q[i+1][2];
        cout<<node[v][0]<<" "<<node[v][1]<<" "<<node[u][0]<<" "<<node[u][1]<<"\n";
    }


}

Compilation message

roads.cpp: In function 'int main()':
roads.cpp:39:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0; i<q.size()-1; i++)
      |                  ~^~~~~~~~~~~

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Failed 1 ms 212 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Failed 1 ms 340 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Failed 1 ms 340 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Failed 1 ms 340 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Failed 1 ms 212 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 212 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -