oj.uz

Submission #1111339

# Submission time Handle Problem Language Result Execution time Memory
1111339 2024-11-12T06:59:34 Z modwwe Martian DNA (BOI18_dna) C++17
100 / 100
 29 ms 6480 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf = 1e9;
const int mod2 = 1e9 + 7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0) x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        //  fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo(),down
    // checktime
}
int a[200001];
int d[200001];
int c[200001];
void phongbeo()
{
    cin>>n>>k>>k;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    for(int i=1; i<=k; i++)
        cin>>l>>r,d[l]=r;
    dem=0;
    for(int i=1; i<=n; i++)
    {
        c[a[i]]++;
        if(c[a[i]]==d[a[i]])dem++;
        if(dem==k)
        {
            s2 =i;
            break;
        }
    }
    s3=1;
    s4=inf;
    if(dem!=k)
    {
        cout<<"impossible";
       return;
    }
    l=1;
    s4=inf;
    c[a[s2]]--;
    for(int i=s2; i<=n; i++)
    {
        c[a[i]]++;
        while(true)
        {
            if(c[a[l]]==d[a[l]]) break;
            c[a[l]]--;
            l++;
        }
        s4=min(s4,i-l+1);
    }
    cout<<s4;
}

Compilation message

dna.cpp:57:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   57 | main()
      | ^~~~
dna.cpp: In function 'int main()':
dna.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
dna.cpp:61:9: note: in expansion of macro 'fin'
   61 |         fin(task);
      |         ^~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4432 KB Output is correct
7 Correct 1 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 2 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 2 ms 4432 KB Output is correct
6 Correct 2 ms 4432 KB Output is correct
7 Correct 1 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 1 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 1 ms 4432 KB Output is correct
14 Correct 1 ms 4600 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5200 KB Output is correct
2 Correct 10 ms 4820 KB Output is correct
3 Correct 10 ms 4944 KB Output is correct
4 Correct 9 ms 5112 KB Output is correct
5 Correct 14 ms 5788 KB Output is correct
6 Correct 11 ms 4944 KB Output is correct
7 Correct 11 ms 4956 KB Output is correct
8 Correct 16 ms 5652 KB Output is correct
9 Correct 17 ms 5456 KB Output is correct
10 Correct 9 ms 5200 KB Output is correct
11 Correct 1 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 2 ms 4432 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 2 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 4432 KB Output is correct
18 Correct 1 ms 4432 KB Output is correct
19 Correct 1 ms 4688 KB Output is correct
20 Correct 2 ms 4432 KB Output is correct
21 Correct 1 ms 4432 KB Output is correct
22 Correct 1 ms 4432 KB Output is correct
23 Correct 1 ms 4432 KB Output is correct
24 Correct 1 ms 4432 KB Output is correct
25 Correct 2 ms 4432 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 6216 KB Output is correct
2 Correct 18 ms 6480 KB Output is correct
3 Correct 16 ms 6224 KB Output is correct
4 Correct 10 ms 4944 KB Output is correct
5 Correct 29 ms 5964 KB Output is correct
6 Correct 23 ms 4944 KB Output is correct
7 Correct 13 ms 5968 KB Output is correct
8 Correct 16 ms 5968 KB Output is correct
9 Correct 9 ms 5200 KB Output is correct
10 Correct 11 ms 5200 KB Output is correct
11 Correct 10 ms 4944 KB Output is correct
12 Correct 10 ms 5316 KB Output is correct
13 Correct 14 ms 5712 KB Output is correct
14 Correct 9 ms 5200 KB Output is correct
15 Correct 12 ms 5176 KB Output is correct
16 Correct 14 ms 5712 KB Output is correct
17 Correct 11 ms 5968 KB Output is correct
18 Correct 9 ms 5364 KB Output is correct
19 Correct 2 ms 4568 KB Output is correct
20 Correct 1 ms 4432 KB Output is correct
21 Correct 2 ms 4432 KB Output is correct
22 Correct 1 ms 4600 KB Output is correct
23 Correct 1 ms 4584 KB Output is correct
24 Correct 1 ms 4600 KB Output is correct
25 Correct 1 ms 4432 KB Output is correct
26 Correct 1 ms 4432 KB Output is correct
27 Correct 1 ms 4432 KB Output is correct
28 Correct 1 ms 4432 KB Output is correct
29 Correct 1 ms 4432 KB Output is correct
30 Correct 2 ms 4432 KB Output is correct
31 Correct 2 ms 4432 KB Output is correct
32 Correct 1 ms 4432 KB Output is correct
33 Correct 1 ms 4604 KB Output is correct