题解归档 - cf2222E

本文由 cf-code 本地题解库自动归档；公开内容以本地 AC/验证版本为准。

• 本地编号：cf2222E
• 本地来源：problems/cf2222E/idea.md
• 题目链接：https://codeforces.com/contest/2222/problem/E
• 原始标题：cf2222E - Seek the Truth

思路

cf2222E - Seek the Truth

Status

This is an interactive problem in the original statement. The statement also
lists a hack format containing the hidden values (n,k,c), but the local
run_exe.py sample is the original interaction transcript, not a normal
deterministic input/output sample.

Blocker

No ordinary solution.cpp has been written yet. To make this locally
verifiable, the next step is to decide and implement one of:

• an actual interactive strategy plus a local interactor/checker for stress;
• if Codeforces uses a non-interactive hacked version for submissions, a
  hacked-format solver, after confirming the required participant I/O.

The current contest automation should not list this problem as manually
submittable until that is resolved and locally verified.

Checks Run

• python tools/math_reasoning_search.py --problem cf2222E -n 8 - required
  precheck done.

代码

来源：problems/cf2222E/solution.cpp

/* Author: likely
 * Time: YYYY-MM-DD HH:MM:SS
**/
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn=200005;
ll s[maxn+5];
int main(){
    ll t,n,i,j,k,zc,pd,cur,dq,cnt,ans;
    cin>>t;
    while(t--){
        cin>>n;
        for(i=1;i<=n;i++) cin>>s[i];
    }
    return 0;
}