oj.uz

답안 #64868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
64868 2018-08-06T00:40:28 Z gs18115 조화행렬 (KOI18_matrix) C++14
23 / 100
 268 ms 54752 KB 
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
const int INF=1e9;
const int MAXN=2e5;
struct matrix
{
    int x,y,z;
    matrix()
    {
        x=y=z=0;
    }
}mat[MAXN];
bool cmp1(matrix a,matrix b)
{
    return a.x<b.x;
}
bool cmp2(matrix a,matrix b)
{
    return a.y<b.y;
}
bool cmp3(matrix a,matrix b)
{
    return a.z<b.z;
}
set<pair<int,int> >S[MAXN];
bool fp(int x,int y,int k)
{
    set<pair<int,int> >::iterator it=S[k].lower_bound(make_pair(x,0));
    if(it==S[k].begin())
        return false;
    it--;
    return it->second<y;
}
void ap(int x,int y,int k)
{
    if(fp(x,y,k))
        return;
    while(true)
    {
        set<pair<int,int> >::iterator it=S[k].lower_bound(make_pair(x,0));
        if(it==S[k].end())
            break;
        else if(it->second>y)
            S[k].erase(it);
        else
            break;
    }
    S[k].insert(make_pair(x,y));
    return;
}
int M,N,i;
int maxi,s,e,mid;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>M>>N;
    for(i=0;i<N;i++)
        cin>>mat[i].x;
    for(i=0;i<N;i++)
        cin>>mat[i].y;
    if(M==2)
        for(i=0;i<N;i++)
            mat[i].z=mat[i].y;
    else
        for(i=0;i<N;i++)
            cin>>mat[i].z;
    sort(mat,mat+N,cmp2);
    for(i=0;i<N;i++)
        mat[i].y=i+1;
    sort(mat,mat+N,cmp3);
    for(i=0;i<N;i++)
        mat[i].z=i+1;
    sort(mat,mat+N,cmp1);
    ap(0,0,0);
    maxi=1;
    for(i=0;i<N;i++)
    {
        s=0;e=maxi;
        while(s<e)
        {
            mid=s+e+1>>1;
            if(fp(mat[i].y,mat[i].z,mid))
                s=mid;
            else
                e=mid-1;
        }
        if(s+2>maxi)
            maxi=s+2;
        ap(mat[i].y,mat[i].z,s+1);
    }
    cout<<maxi-1;
    return 0;
}

Compilation message

matrix.cpp: In function 'int main()':
matrix.cpp:86:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
             mid=s+e+1>>1;
                 ~~~^~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 11988 KB Output is correct
2 Correct 21 ms 12136 KB Output is correct
3 Correct 23 ms 12320 KB Output is correct
4 Correct 18 ms 12376 KB Output is correct
5 Correct 21 ms 12376 KB Output is correct
6 Correct 20 ms 12680 KB Output is correct
7 Correct 19 ms 12680 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 12680 KB Output is correct
2 Correct 23 ms 12680 KB Output is correct
3 Correct 23 ms 12680 KB Output is correct
4 Correct 33 ms 12680 KB Output is correct
5 Correct 24 ms 12680 KB Output is correct
6 Correct 36 ms 12780 KB Output is correct
7 Correct 29 ms 12780 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 11988 KB Output is correct
2 Correct 21 ms 12136 KB Output is correct
3 Correct 23 ms 12320 KB Output is correct
4 Correct 18 ms 12376 KB Output is correct
5 Correct 21 ms 12376 KB Output is correct
6 Correct 20 ms 12680 KB Output is correct
7 Correct 19 ms 12680 KB Output is correct
8 Correct 213 ms 12780 KB Output is correct
9 Correct 179 ms 12780 KB Output is correct
10 Correct 161 ms 14416 KB Output is correct
11 Correct 128 ms 14416 KB Output is correct
12 Correct 166 ms 14416 KB Output is correct
13 Correct 186 ms 17132 KB Output is correct
14 Correct 227 ms 17132 KB Output is correct
15 Correct 136 ms 17132 KB Output is correct
16 Runtime error 193 ms 43116 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -

Subtask #4
0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 12680 KB Output is correct
2 Correct 23 ms 12680 KB Output is correct
3 Correct 23 ms 12680 KB Output is correct
4 Correct 33 ms 12680 KB Output is correct
5 Correct 24 ms 12680 KB Output is correct
6 Correct 36 ms 12780 KB Output is correct
7 Correct 29 ms 12780 KB Output is correct
8 Correct 268 ms 43116 KB Output is correct
9 Correct 267 ms 43116 KB Output is correct
10 Correct 226 ms 46272 KB Output is correct
11 Runtime error 252 ms 54752 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -