# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676647 | 2022-12-31T14:59:51 Z | owoovo | Sandcastle 2 (JOI22_ho_t5) | C++14 | 0 ms | 312 KB |
#include<bits/stdc++.h> #define ll long long using namespace std; int ori[500010]; int main(){ ll n,m; cin>>n>>m; if(n!=1){ cout<<"0\n"; return 0; } for(int i=0;i<m;i++){ cin>>ori[i]; } ll ans=0; ll nowc=2; for(int i=2;i<m;i++){ if(ori[i]>ori[i-1]^ori[i-1]>ori[i-2]){ ans+=nowc*(nowc-1)/2+nowc-1; nowc=2; }else{ nowc++; } } ans+=nowc*(nowc-1)/2+nowc; cout<<ans<<'\n'; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 312 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 312 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 312 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 312 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |