oj.uz

답안 #637122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
637122 2022-08-31T15:37:02 Z ggoh Roller Coaster Railroad (IOI16_railroad) C++14
0 / 100
 138 ms 6704 KB 
//after read editorial :cry:
#include<bits/stdc++.h>
#include "railroad.h"
using namespace std;
#define sz(v) ((int)(v).size())
typedef long long lint;
typedef pair<int,int> pii;

int deg[400004];
lint plan_roller_coaster(vector<int> s, vector<int> t) {

    int n = sz(s);
    lint ans=0;
    vector<int>X;
    for(int i=0;i<n;i++)X.push_back(s[i]);
    for(int i=0;i<n;i++)X.push_back(t[i]);
    sort(X.begin(),X.end());
    X.erase(unique(X.begin(),X.end()),X.end());
    int m=sz(X);
    for(int i=0;i<n;i++)
    {
      deg[lower_bound(X.begin(),X.end(),s[i])-X.begin()]++;
      deg[lower_bound(X.begin(),X.end(),t[i])-X.begin()]--;
    }
    deg[0]--;
    deg[m-1]++;
    int cha=0;
    int ch=0;
    for(int i=0;i<m;i++)
    {
      deg[i]-=cha;
      cha=0;
      if(deg[i]<0)
      { 
        cha=-deg[i];
      }
      else if(deg[i]>0)
      {
        ch=1;break;
      }
    }
    if(cha)ch=1;
    return ch;
}

Compilation message

railroad.cpp: In function 'lint plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:13:10: warning: unused variable 'ans' [-Wunused-variable]
   13 |     lint ans=0;
      |          ^~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Incorrect 1 ms 212 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Incorrect 1 ms 212 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 6596 KB n = 199999
2 Correct 135 ms 6704 KB n = 199991
3 Correct 128 ms 6608 KB n = 199993
4 Correct 97 ms 5192 KB n = 152076
5 Correct 59 ms 3240 KB n = 93249
6 Correct 122 ms 6348 KB n = 199910
7 Correct 121 ms 6664 KB n = 199999
8 Correct 121 ms 6332 KB n = 199997
9 Correct 127 ms 5744 KB n = 171294
10 Correct 90 ms 4796 KB n = 140872
11 Incorrect 122 ms 6420 KB answer is not correct: 0 instead of 1
12 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Incorrect 1 ms 212 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -