QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#291671 | #7625. Path | jzhong0821 | WA | 0ms | 3644kb | C++17 | 942b | 2023-12-27 02:38:28 | 2023-12-27 02:38:28 |
Judging History
answer
#include <iostream>
#include <assert.h>
#include <cstring>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
#define fo(x) freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout)
#define f1(i,k) for(int i=1,end_i=(k);i<=end_i;i++)
#define f0(i,k) for(int i=0,end_i=(k);i< end_i;i++)
#define cle(x) memset(x, 0, sizeof(x))
#define lobit(x) ((x) & -(x))
#define ll long long
#define pb push_back
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;return x;
}
const int inf = 2e18;
const int lim = 500005;
const int mv = 1500;
int n,m;
int a[lim],b[lim];
ll res;
void work(){
cin>>n>>m;
f1(i,m){
}
}
int main(){
int t;
cin>>t;
while(t--){
work();
}
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3644kb
input:
4 4 1 3 3 1 8 10 8 5
output:
result:
wrong answer 1st lines differ - expected: '11', found: ''