Submission #68261429


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,a,n) for (int i=(n)-1;i>=(a);i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=201000;
int n;
int a[N],b[N];
bool solve() {
	scanf("%d",&n);
	bool sm=1;
	int sa=0,sb=0;
	rep(i,1,n+1) scanf("%d",&a[i]),sa+=a[i];
	rep(i,1,n+1) scanf("%d",&b[i]),sm&=a[i]==b[i],sb+=b[i];
	if (sm) return true;
	if (sa!=sb) return false;
	if (sa>=2) return true;
	if (a[1]!=1&&a[n]!=1&&b[1]!=1&&b[n]!=1) return true;
	return false;
}
int _;
int main() {
	for (scanf("%d",&_);_;_--) {
		puts(solve()?"Yes":"No");
	}
}

Submission Info

Submission Time
Task B - Swap If Equal Sum
User apiad
Language C++ 20 (gcc 12.2)
Score 500
Code Size 1167 Byte
Status AC
Exec Time 27 ms
Memory 5468 KiB

Compile Error

Main.cpp: In function ‘bool solve()’:
Main.cpp:28:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   28 |         scanf("%d",&n);
      |         ~~~~~^~~~~~~~~
Main.cpp:31:27: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   31 |         rep(i,1,n+1) scanf("%d",&a[i]),sa+=a[i];
      |                      ~~~~~^~~~~~~~~~~~
Main.cpp:32:27: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   32 |         rep(i,1,n+1) scanf("%d",&b[i]),sm&=a[i]==b[i],sb+=b[i];
      |                      ~~~~~^~~~~~~~~~~~
Main.cpp: In function ‘int main()’:
Main.cpp:41:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   41 |         for (scanf("%d",&_);_;_--) {
      |              ~~~~~^~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 1
AC × 58
Set Name Test Cases
Sample sample.txt
All 1_1.txt, 1_10.txt, 1_2.txt, 1_3.txt, 1_4.txt, 1_5.txt, 1_6.txt, 1_7.txt, 1_8.txt, 1_9.txt, 2_1.txt, 2_10.txt, 2_2.txt, 2_3.txt, 2_4.txt, 2_5.txt, 2_6.txt, 2_7.txt, 2_8.txt, 2_9.txt, 3_1.txt, 3_10.txt, 3_11.txt, 3_12.txt, 3_13.txt, 3_14.txt, 3_15.txt, 3_16.txt, 3_17.txt, 3_18.txt, 3_19.txt, 3_2.txt, 3_20.txt, 3_3.txt, 3_4.txt, 3_5.txt, 3_6.txt, 3_7.txt, 3_8.txt, 3_9.txt, 4_1.txt, 4_10.txt, 4_11.txt, 4_12.txt, 4_13.txt, 4_14.txt, 4_15.txt, 4_16.txt, 4_2.txt, 4_3.txt, 4_4.txt, 4_5.txt, 4_6.txt, 4_7.txt, 4_8.txt, 4_9.txt, 5.txt, sample.txt
Case Name Status Exec Time Memory
1_1.txt AC 19 ms 4316 KiB
1_10.txt AC 18 ms 4320 KiB
1_2.txt AC 21 ms 5324 KiB
1_3.txt AC 19 ms 4536 KiB
1_4.txt AC 19 ms 4540 KiB
1_5.txt AC 19 ms 5296 KiB
1_6.txt AC 20 ms 4356 KiB
1_7.txt AC 19 ms 5016 KiB
1_8.txt AC 21 ms 4816 KiB
1_9.txt AC 19 ms 4576 KiB
2_1.txt AC 19 ms 3788 KiB
2_10.txt AC 19 ms 3716 KiB
2_2.txt AC 19 ms 3600 KiB
2_3.txt AC 19 ms 3536 KiB
2_4.txt AC 19 ms 3716 KiB
2_5.txt AC 19 ms 3604 KiB
2_6.txt AC 19 ms 3712 KiB
2_7.txt AC 19 ms 3652 KiB
2_8.txt AC 19 ms 3776 KiB
2_9.txt AC 20 ms 3652 KiB
3_1.txt AC 20 ms 5272 KiB
3_10.txt AC 19 ms 5164 KiB
3_11.txt AC 20 ms 5272 KiB
3_12.txt AC 20 ms 5240 KiB
3_13.txt AC 20 ms 5244 KiB
3_14.txt AC 20 ms 5468 KiB
3_15.txt AC 20 ms 5160 KiB
3_16.txt AC 20 ms 5348 KiB
3_17.txt AC 20 ms 5192 KiB
3_18.txt AC 20 ms 5272 KiB
3_19.txt AC 20 ms 5468 KiB
3_2.txt AC 20 ms 5328 KiB
3_20.txt AC 20 ms 5208 KiB
3_3.txt AC 19 ms 5276 KiB
3_4.txt AC 18 ms 5228 KiB
3_5.txt AC 21 ms 5336 KiB
3_6.txt AC 20 ms 5084 KiB
3_7.txt AC 20 ms 5348 KiB
3_8.txt AC 18 ms 5152 KiB
3_9.txt AC 20 ms 5264 KiB
4_1.txt AC 21 ms 3908 KiB
4_10.txt AC 21 ms 3604 KiB
4_11.txt AC 22 ms 3788 KiB
4_12.txt AC 21 ms 3700 KiB
4_13.txt AC 22 ms 3780 KiB
4_14.txt AC 21 ms 3716 KiB
4_15.txt AC 22 ms 3680 KiB
4_16.txt AC 4 ms 3712 KiB
4_2.txt AC 21 ms 3652 KiB
4_3.txt AC 21 ms 3536 KiB
4_4.txt AC 22 ms 3904 KiB
4_5.txt AC 21 ms 3716 KiB
4_6.txt AC 21 ms 3756 KiB
4_7.txt AC 21 ms 3652 KiB
4_8.txt AC 21 ms 3540 KiB
4_9.txt AC 21 ms 3756 KiB
5.txt AC 27 ms 3700 KiB
sample.txt AC 1 ms 3664 KiB