oj.uz

답안 #525455

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525455 2022-02-11T16:53:18 Z ammar2000 Lottery (CEOI18_lot) C++17
25 / 100
 258 ms 65540 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,a[SI],Q,l,k;
vector <ll> v[SI];
map <pair <ll,ll > ,ll>  mp;
int main()
{
   fast
   cin>>n>>l;
   for (int i=0;i<n;i++)
    cin>>a[i];
   for (int i=0;i+l-1<n;i++)
     for (int u=0;u<l;u++)
         v[i].pb(a[u+i]);
   for (int i=0;i+l-1<n;i++)
     for (int u=i+1;u+l-1<n;u++)
     {
         ll d=0;
         for (int y=0;y<l;y++)
             if (v[i][y]!=v[u][y])
                d++;
         mp[{i,u}]=mp[{u,i}]=d;
     }
   ll q;
   cin>>q;
   while (q--)
   {
       ll k;
       cin>>k;
       for (int i=0;i+l-1<n;i++)
       {
        ll ans=0;
        for (int u=0;u+l-1<n;u++)
         {
           if (i!=u&&mp[{i,u}]<=k)
                ans++;
         }
       cout  <<ans <<" ";
       }
       cout << "\n";
   }
   return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 10 ms 7628 KB Output is correct
3 Correct 13 ms 7752 KB Output is correct
4 Correct 5 ms 7500 KB Output is correct
5 Correct 5 ms 7496 KB Output is correct
6 Correct 9 ms 7920 KB Output is correct
7 Correct 10 ms 7836 KB Output is correct
8 Correct 38 ms 9036 KB Output is correct
9 Correct 37 ms 9088 KB Output is correct
10 Correct 133 ms 12484 KB Output is correct
11 Correct 132 ms 12464 KB Output is correct
12 Correct 120 ms 11980 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 10 ms 7628 KB Output is correct
3 Correct 13 ms 7752 KB Output is correct
4 Correct 5 ms 7500 KB Output is correct
5 Correct 5 ms 7496 KB Output is correct
6 Correct 9 ms 7920 KB Output is correct
7 Correct 10 ms 7836 KB Output is correct
8 Correct 38 ms 9036 KB Output is correct
9 Correct 37 ms 9088 KB Output is correct
10 Correct 133 ms 12484 KB Output is correct
11 Correct 132 ms 12464 KB Output is correct
12 Correct 120 ms 11980 KB Output is correct
13 Runtime error 206 ms 65540 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 258 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 258 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 10 ms 7628 KB Output is correct
3 Correct 13 ms 7752 KB Output is correct
4 Correct 5 ms 7500 KB Output is correct
5 Correct 5 ms 7496 KB Output is correct
6 Correct 9 ms 7920 KB Output is correct
7 Correct 10 ms 7836 KB Output is correct
8 Correct 38 ms 9036 KB Output is correct
9 Correct 37 ms 9088 KB Output is correct
10 Correct 133 ms 12484 KB Output is correct
11 Correct 132 ms 12464 KB Output is correct
12 Correct 120 ms 11980 KB Output is correct
13 Runtime error 206 ms 65540 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -