oj.uz

답안 #921431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921431 2024-02-03T20:20:34 Z maxFedorchuk Trampoline (info1cup20_trampoline) C++17
0 / 100
 255 ms 41120 KB 
#include "bits/stdc++.h"
using namespace std;

const long long MX=5e5+100;

vector < pair < int , int > > mas[MX];
set < pair < int , int > > ab;
vector < int > reb[MX];

int r,c,n;

int uk=0,nm=0;

void cnt()
{
    map < int , int > as;

    for(auto u:ab)
    {
        as[u.first-1]++;
        as[u.first]++;
        as[u.first+1]++;
    }

    for(auto & u:as)
    {
        uk++;
        u.second=uk;
    }

    for(auto u:ab)
    {
        nm++;
        mas[as[u.first]].push_back({u.second,nm});
    }

    for(int i=1;i<=uk;i++)
    {
        nm++;
        mas[i].push_back({c+1,nm});
    }

    return;
}

void cnt2()
{
    for(int i=1;i<=uk;i++)
    {
        
    }
}
int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    cin>>r>>c>>n;

    int a,b;
    for(int i=1;i<=n;i++)
    {
        cin>>a>>b;
        ab.insert({a,b});
    }

    cnt();
    cnt2();
}

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 24412 KB Answer contains longer sequence [length = 200], but output contains 0 elements
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 172 ms 35724 KB Answer contains longer sequence [length = 4000], but output contains 0 elements
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 122 ms 35228 KB Answer contains longer sequence [length = 200000], but output contains 0 elements
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 24408 KB Answer contains longer sequence [length = 5000], but output contains 0 elements
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 255 ms 41120 KB Answer contains longer sequence [length = 200000], but output contains 0 elements
2 Halted 0 ms 0 KB -