oj.uz

답안 #64869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
64869 2018-08-06T00:43:02 Z gs18115 조화행렬 (KOI18_matrix) C++14
23 / 100
 291 ms 43376 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=0;
    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>=maxi)
            maxi=s+1;
        ap(mat[i].y,mat[i].z,s+1);
    }
    cout<<maxi;
    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 12024 KB Output is correct
2 Correct 19 ms 12300 KB Output is correct
3 Correct 22 ms 12300 KB Output is correct
4 Correct 26 ms 12396 KB Output is correct
5 Correct 26 ms 12396 KB Output is correct
6 Correct 19 ms 12652 KB Output is correct
7 Correct 18 ms 12652 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 12652 KB Output is correct
2 Correct 22 ms 12652 KB Output is correct
3 Correct 22 ms 12652 KB Output is correct
4 Correct 25 ms 12652 KB Output is correct
5 Correct 24 ms 12652 KB Output is correct
6 Correct 21 ms 12740 KB Output is correct
7 Correct 23 ms 12740 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12024 KB Output is correct
2 Correct 19 ms 12300 KB Output is correct
3 Correct 22 ms 12300 KB Output is correct
4 Correct 26 ms 12396 KB Output is correct
5 Correct 26 ms 12396 KB Output is correct
6 Correct 19 ms 12652 KB Output is correct
7 Correct 18 ms 12652 KB Output is correct
8 Correct 213 ms 12740 KB Output is correct
9 Correct 213 ms 12740 KB Output is correct
10 Correct 169 ms 14420 KB Output is correct
11 Correct 148 ms 14420 KB Output is correct
12 Correct 169 ms 14420 KB Output is correct
13 Correct 194 ms 16980 KB Output is correct
14 Correct 176 ms 16980 KB Output is correct
15 Correct 149 ms 16980 KB Output is correct
16 Runtime error 219 ms 43376 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 22 ms 12652 KB Output is correct
2 Correct 22 ms 12652 KB Output is correct
3 Correct 22 ms 12652 KB Output is correct
4 Correct 25 ms 12652 KB Output is correct
5 Correct 24 ms 12652 KB Output is correct
6 Correct 21 ms 12740 KB Output is correct
7 Correct 23 ms 12740 KB Output is correct
8 Correct 248 ms 43376 KB Output is correct
9 Correct 279 ms 43376 KB Output is correct
10 Correct 291 ms 43376 KB Output is correct
11 Runtime error 250 ms 43376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -