Submission #1056750

#TimeUsernameProblemLanguageResultExecution timeMemory
1056750mindiyak Martian DNA (BOI18_dna)C++14
0 / 100
14 ms1824 KiB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops") #include <bits/stdc++.h> #include <string> #include <iostream> #include <cmath> #include <numeric> #include <stack> #include <queue> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<ld, ld> pd; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<vector<int>> vvi; typedef vector<vector<pi>> vvpi; typedef vector<ld> vd; typedef vector<long long> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; #define FOR(i, a, b) for (int i = a; i < (b); i++) #define F0R(i, a) for (int i = 0; i < (a); i++) #define FORd(i, a, b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--) #define trav(a, x) for (auto &a : x) #define uid(a, b) uniform_int_distribution<int>(a, b)(rng) #define len(x) (int)(x).size() #define mp make_pair #define pb push_back #define F first #define nl endl #define S second #define lb lower_bound #define ub upper_bound #define aint(x) x.begin(), x.end() #define raint(x) x.rbegin(), x.rend() #define ins insert const int M = 1e9+7; void init(string name) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } void fastIO() { ios_base::sync_with_stdio(0); cin.tie(0); } int n,r,k; void solve() { cin >> n >> k >> r; vi arr(n); FOR(i,0,n)cin >> arr[i]; vi needed(k,0); int counter = 0; FOR(i,0,r){ int a,b;cin >> a >> b; if(b == 0)counter ++; needed[a] = b; } r = r-counter; if(r == 0){ cout << 0 << endl; return; } int ans = n+1; FOR(i,0,n){ int j = i; int pos = i; int cnt = 0; vi temp = needed; while(j < n && cnt < r){ if(temp[arr[j]] == 1)cnt ++; temp[arr[j]] --; j++; } while(i < j && cnt == r){ if(needed[arr[i]] > 0){ if(temp[arr[i]] >= 0)break; temp[arr[i]] ++; } i++; } cerr << cnt << " " << i << " " << j << endl; if(cnt == r)ans = min(ans,j-i); i = j; } if(ans != n+1){ cout << ans << endl; return; } cout << "impossible" << endl; } int main() { fastIO(); // init("test"); int t = 1; // cin >> t; while (t--) solve(); return 0; }

Compilation message (stderr)

dna.cpp: In function 'void solve()':
dna.cpp:79:13: warning: unused variable 'pos' [-Wunused-variable]
   79 |         int pos = i;
      |             ^~~
dna.cpp: In function 'void init(std::string)':
dna.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dna.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...