QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#340281#1. I/O TestBYR_KKK100 235ms3712kbC++143.1kb2024-02-28 20:13:112024-02-28 20:13:12

Judging History

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

  • [2024-02-28 20:13:12]
  • 评测
  • 测评结果:100
  • 用时:235ms
  • 内存:3712kb
  • [2024-02-28 20:13:11]
  • 提交

config.txt

10000000 0

input_test

// LUOGU_RID: 148461593
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define gt getchar
#define pt putchar
#define fst first
#define scd second
#define SZ(s) ((int)s.size())
#define all(s) s.begin(),s.end()
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
const int N=5e6+5;
const int R=1e5+5;
const int M=5e6+5;
const ll inf=1e18;
using namespace std;
using namespace __gnu_pbds;
typedef pair<int,int> pii;
template<class T,class I> inline void chkmax(T &a,I b){a=max(a,(T)b);}
template<class T,class I> inline void chkmin(T &a,I b){a=min(a,(T)b);}
inline bool __(char ch){return ch>=48&&ch<=57;}
template<class T> inline void read(T &x){
	x=0;bool sgn=0;static char ch=gt();
	while(!__(ch)&&ch!=EOF) sgn|=(ch=='-'),ch=gt();
	while(__(ch)) x=(x<<1)+(x<<3)+(ch&15),ch=gt();
	if(sgn) x=-x;
}
template<class T,class ...I> inline void read(T &x,I &...x1){
	read(x);
	read(x1...);
}
template<class T> inline void print(T x){
	static char stk[70];short top=0;
	if(x<0) pt('-');
	do{stk[++top]=x>=0?(x%10+48):(-(x%10)+48),x/=10;}while(x);
	while(top) pt(stk[top--]);
}
template<class T> inline void printsp(T x){
	print(x);
	putchar(' ');
}
template<class T> inline void println(T x){
	print(x);
	putchar('\n');
}

signed main(){
	int n;
	read(n);
	ll sum=0;
	while(n--){
		int a;
		read(a);
		sum+=a;
	}
	printf("%lld",sum);
	return 0;
}

output_test

// LUOGU_RID: 148461593
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define gt getchar
#define pt putchar
#define fst first
#define scd second
#define SZ(s) ((int)s.size())
#define all(s) s.begin(),s.end()
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
const int N=5e6+5;
const int R=1e5+5;
const int M=5e6+5;
const ll inf=1e18;
const int P=1e8;
using namespace std;
using namespace __gnu_pbds;
typedef pair<int,int> pii;
template<class T,class I> inline void chkmax(T &a,I b){a=max(a,(T)b);}
template<class T,class I> inline void chkmin(T &a,I b){a=min(a,(T)b);}
inline bool __(char ch){return ch>=48&&ch<=57;}
template<class T> inline void read(T &x){
	x=0;bool sgn=0;static char ch=gt();
	while(!__(ch)&&ch!=EOF) sgn|=(ch=='-'),ch=gt();
	while(__(ch)) x=(x<<1)+(x<<3)+(ch&15),ch=gt();
	if(sgn) x=-x;
}
template<class T,class ...I> inline void read(T &x,I &...x1){
	read(x);
	read(x1...);
}
template<class T> inline void print(T x){
	static char stk[70];short top=0;
	if(x<0) pt('-');
	do{stk[++top]=x>=0?(x%10+48):(-(x%10)+48),x/=10;}while(x);
	while(top) pt(stk[top--]);
}
template<class T> inline void printsp(T x){
	print(x);
	putchar(' ');
}
template<class T> inline void println(T x){
	print(x);
	putchar('\n');
}

signed main(){
	int n;
	read(n);
	while(n--){
		printsp(P);
	}
	return 0;
}

详细

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 235ms
memory: 3712kb

input:

10000000
135251885 852308535 581821977 704348385 755140281 587304680 389478722 292993503 300571828 220044023 831708981 550815670 898260433 395822878 324698454 866842224 161816749 286464703 686289701 385359173 603060913 831859051 734656552 822202480 886877384 117399131 364496228 946575697 578760683 4...

output:

5499910174230628

result:

points 1.0 input test passed

Subtask #2:

score: 0
Skipped