QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#208415 | #6765. Don't Really Like How The Story Ends | 275307894a | WA | 76ms | 8792kb | C++14 | 1.4kb | 2023-10-09 16:14:27 | 2023-10-09 16:14:27 |
Judging History
answer
#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=1e5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-6;const ll INF=1e18+7;mt19937 rnd(263082);
int n,m,g[N];vector<int> S[N],w[N];
namespace BIT{
int f[N];void Cl(){fill(f+1,f+n+1,0);}
void add(int x,int w){while(x) f[x]=max(f[x],w),x-=x&-x;}
int qry(int x){int ans=0;while(x<=n) ans=max(ans,f[x]),x+=x&-x;return ans;}
}
void Solve(){
int i,j;scanf("%d%d",&n,&m);
for(i=1;i<=n;i++) S[i].clear();
while(m--) {
int x,y;scanf("%d%d",&x,&y);if(x>y) swap(x,y);if(x^y) S[y].emplace_back(x);
}
BIT::Cl();
int ans=0;
for(i=1;i<=n;i++){
w[i].clear();
for(int j:S[i]) {
int pw=max(g[j],BIT::qry(j))+1;
w[i].emplace_back(pw);g[i]=max(g[i],pw);
}
g[i]=max(g[i-1],g[i]);ans=max(ans,g[i]);
for(int j=0;j<S[i].size();j++) BIT::add(j,S[i][j]);
}
printf("%d\n",n-1-ans);
}
int main(){
int t=1;
scanf("%d",&t);
while(t--) Solve();
cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 8740kb
input:
3 2 3 1 1 1 2 2 1 4 1 1 4 4 2 1 2 3 4
output:
0 2 1
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 76ms
memory: 8792kb
input:
117747 3 7 2 1 3 3 1 3 1 1 3 2 1 1 3 1 4 8 2 3 4 3 3 2 4 2 1 3 2 1 4 3 2 4 3 4 2 3 2 2 3 3 1 1 2 5 1 1 2 2 2 2 1 2 2 2 3 7 2 1 1 2 3 3 3 2 1 2 3 3 3 2 4 5 1 2 3 3 4 4 1 4 2 1 3 1 3 2 1 3 1 1 1 1 1 1 1 6 1 1 1 1 1 1 1 1 1 1 1 1 5 4 2 1 2 5 1 3 3 2 4 7 1 1 2 4 3 2 1 1 1 1 4 2 2 3 5 8 3 3 2 2 4 2 1 4 1...
output:
0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
wrong answer 3rd lines differ - expected: '1', found: '0'