QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#331598#5203. Easy AssemblyKevin5307#WA 1ms3620kbC++231014b2024-02-18 15:40:182024-02-18 15:40:19

Judging History

你现在查看的是最新测评结果

  • [2024-02-18 15:40:19]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3620kb
  • [2024-02-18 15:40:18]
  • 提交

answer

//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	int ans=n-1;
	while(n--)
	{
		int k;
		cin>>k;
		vector<int> vec;
		while(k--)
		{
			int x;
			cin>>x;
			vec.pb(x);
		}
		for(int i=1;i<sz(vec);i++)
			if(vec[i-1]>vec[i])
				ans+=2;
	}
	cout<<ans<<endl;
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3620kb

input:

2
3 3 5 8
2 9 2

output:

3

result:

wrong answer 1st numbers differ - expected: '1', found: '3'