QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#131834 | #5128. Dividing DNA | PetroTarnavskyi# | WA | 0ms | 3448kb | C++17 | 762b | 2023-07-28 15:08:08 | 2023-07-28 15:08:08 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0);
int n;
cin >> n;
int ans = 0;
int prev = 0;
FOR(i, 0, n){
cout << "? " << prev << " " << i << endl;
string s;
cin >> s;
if(s == "absent"){
prev = i + 1;
ans++;
}
}
cout << "! " << ans << endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3448kb
input:
1
output:
? 0 0
result:
wrong answer l must be non-empty