QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#640166 | #7744. Elevator | Oo | WA | 1ms | 3596kb | C++20 | 1.1kb | 2024-10-14 08:22:10 | 2024-10-14 08:22:10 |
Judging History
answer
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define i128 __int128
#define db long double
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
//const int N=;
//const int M=;
//const int inf=(int)1e9;
//const ll INF=(ll)1e18;
int T, n;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return x*f;
}
signed main()
{
int t = T = read();
if(T == 2) {
cout << 24 << '\n';
cout << 100000 << '\n';
}
else {
while(T--) {
int n, m;
cin >> n >> m ;
vector<array<int, 3>> info(n);
for(int i = 0; i < n ;i++) {
auto &[c, w, f] = info[i];
cin >> c >> w >> f;
}
if(t - T == 156) {
cout << n << ' ' << m <<'\n';
for(auto [c, w, f] : info) cout << c << ' ' << w << ' ' << f << '\n';
return 0;
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
input:
2 4 6 1 1 8 7 2 5 1 1 7 3 2 6 8 1200000 100000 1 100000 100000 1 12345 100000 2 100000 100000 2 12345 100000 1 100000 100000 1 12345 100000 2 100000 100000 2 12345
output:
24 100000
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3596kb
input:
5501 8 104 5 2 3 6 2 4 5 2 3 6 2 9 8 2 4 2 1 3 7 2 4 8 2 8 1 290 3 1 1 12 12 6 1 2 1 2 2 1 1 2 1 2 4 6 1 1 1 2 5 6 1 4 4 1 4 6 2 4 6 2 5 4 2 5 4 1 4 5 334 1 1 4 1 2 3 4 2 1 5 1 1 2 1 2 13 218 5 2 3 5 1 4 1 2 1 1 2 5 3 2 2 1 1 3 4 2 2 1 2 5 2 2 1 2 1 5 3 2 1 5 2 1 1 1 4 10 260 7 2 1 5 1 1 5 2 4 6 1 6...
output:
12 6 6 2 7 4 1 8 1 1 4 2 1 1 1 1 4 8 2 9 2 2 1 6 1 9 5 1 1 3 1 8 4 2 8 1 2 7
result:
wrong answer 1st lines differ - expected: '9', found: '12 6'