oj.uz

답안 #535876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535876 2022-03-11T15:42:02 Z ammar2000 Martian DNA (BOI18_dna) C++17
0 / 100
 29 ms 4712 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,k,r;
ll a[SI],w[SI],c[SI];
ll st;
int main()
{
   fast
   cin>>n>>k>>r;
   for (int i=0;i<n;i++)
    cin>>a[i];
   for (int i=0;i<r;i++)
   {
     ll x,y;
     cin>>x>>y;
     w[x]=y;
     st++;
   }
   ll f=0,s=0,ans=INF;
   while (f<n&&s<n)
   {
       while (s<n&&st)
       {
          c[a[s]]++;
          if (c[a[s]]==w[a[s]])
            st--;
          s++;
       }
       //cout<<f<<" "<<s<<"\n";
       if (s==n&&st)
        break;
       ans=min(ans,s-f);
       if (c[a[f]]==w[a[f]])
        st++;
       c[a[f++]]--;
   }
   if (ans==INF)
    cout <<"impossible\n";
   else cout <<ans;
   // use scanf not cin
   return 0;
}

/*
5 2 2
0 1 1 0 1
0 1
1 1
*/

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Incorrect 1 ms 340 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1876 KB Output is correct
2 Correct 12 ms 1876 KB Output is correct
3 Correct 13 ms 1900 KB Output is correct
4 Correct 15 ms 1808 KB Output is correct
5 Correct 15 ms 2444 KB Output is correct
6 Correct 11 ms 1876 KB Output is correct
7 Correct 11 ms 2404 KB Output is correct
8 Correct 20 ms 4644 KB Output is correct
9 Correct 16 ms 2828 KB Output is correct
10 Correct 11 ms 2260 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 376 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Incorrect 0 ms 340 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3068 KB Output is correct
2 Correct 23 ms 2772 KB Output is correct
3 Correct 19 ms 2788 KB Output is correct
4 Correct 10 ms 1780 KB Output is correct
5 Correct 26 ms 3416 KB Output is correct
6 Correct 29 ms 4584 KB Output is correct
7 Correct 17 ms 1928 KB Output is correct
8 Correct 21 ms 2096 KB Output is correct
9 Correct 11 ms 1876 KB Output is correct
10 Correct 10 ms 1852 KB Output is correct
11 Correct 13 ms 1860 KB Output is correct
12 Correct 11 ms 1876 KB Output is correct
13 Correct 15 ms 2516 KB Output is correct
14 Correct 11 ms 1968 KB Output is correct
15 Correct 12 ms 2388 KB Output is correct
16 Correct 20 ms 4712 KB Output is correct
17 Correct 15 ms 2920 KB Output is correct
18 Correct 11 ms 2280 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 376 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Incorrect 0 ms 340 KB Output isn't correct
31 Halted 0 ms 0 KB -