submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | language stringclasses 3
values | code stringlengths 1 522k | compiler_output stringlengths 43 10.2k |
|---|---|---|---|---|
s953337835 | p03716 | C++ | #include<stdio.h>
#include<string.h>
#include<algorithm>
#include<stdlib.h>
#include<iostream>
#include<queue>
using namespace std;
priority_queue<int>QD;
priority_queue<int,vector<int>,greater<int> >QU;
typedef long long ll;
int n;
int a[310000];
ll pmx[310000],qmn[310000],smx,smn,ans=-(1ll<<60);
int main(){
... | a.cc:54:2: error: stray '#' in program
54 | }#include<stdio.h>
| ^
a.cc:54:3: error: 'include' does not name a type
54 | }#include<stdio.h>
| ^~~~~~~
a.cc:62:20: error: redefinition of 'std::priority_queue<int> QD'
62 | priority_queue<int>QD;
| ^~
a.cc:9:20: note: 'std::... |
s627578104 | p03716 | C++ | #include<stdio.h>
#include<string.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<math.h>
#include<queue>
#include<functional>
#include<limits.h>
#include<set>
#define int long long
using namespace std;
int c[300000];
ve... | a.cc: In function 'int main()':
a.cc:23:4: error: 'N' was not declared in this scope
23 | if(N<=1000)return 0;
| ^
|
s907273414 | p03716 | C++ | #include <iostream>
#include <queue>
#include <type_traits>
#include <functional>
#include <algorithm>
using ll=long long int;
constexpr int MAX_N=(int)1e5;
constexpr ll INF=-(int)1e15;
template<bool B>
using Q = std::priority_queue<int,std::vector<int>,std::conditional_t<B,std::greater<>,std::less<>>>;
Q<true> fi... | a.cc:11:18: error: overflow in constant expression [-fpermissive]
11 | constexpr ll INF=-(int)1e15;
| ^~~~~~~~~~
a.cc:11:24: error: overflow in constant expression [-fpermissive]
11 | constexpr ll INF=-(int)1e15;
| ^~~~
|
s673550993 | p03716 | C++ | #include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
int main()
{
long long n = 0;
cin >> n;
long long* a = new long long [3*n];
for(long long i = 0; i < 3*n; i++){
cin >> a[i];
}
long long compare = 0;
for(long long i = 0; i < 2*n){
for(long long ii = i + 1; ii < 2*n;... | a.cc: In function 'int main()':
a.cc:20:37: error: expected ';' before ')' token
20 | for(long long i = 0; i < 2*n){
| ^
| ;
|
s084687641 | p03716 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#in... | a.cc:108:9: warning: "bitset" redefined
108 | #define bitset(a,b) ( a |= ((T)1 << b))
| ^~~~~~
a.cc:30:9: note: this is the location of the previous definition
30 | #define bitset(a,b) ( a |= (1 << b))
| ^~~~~~
a.cc:109:9: warning: "bitunset" redefined
109 | #define bitunset... |
s440565043 | p03716 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#in... | a.cc: In instantiation of 'std::pair<long long int, int> WaveletMatrix<T>::more_kthsum(int, int, int, int) [with T = int]':
a.cc:230:24: required from here
230 | ll b = wv.more_kthsum(0, i, n - 1).first, c = wv.less_kthsum(i, n * 3, n - 1).first;
| ~~~~~~~~~~~~~~^~~~~~~~... |
s737583828 | p03716 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#in... | In file included from /usr/lib/gcc/x86_64-linux-gnu/14/include/smmintrin.h:812,
from /usr/lib/gcc/x86_64-linux-gnu/14/include/nmmintrin.h:31,
from a.cc:18:
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h: In member function 'int Bitvector::rank(int, bool)':
/usr/lib/gcc/x86_64-... |
s604678866 | p03716 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#in... | In file included from /usr/lib/gcc/x86_64-linux-gnu/14/include/smmintrin.h:812,
from /usr/lib/gcc/x86_64-linux-gnu/14/include/nmmintrin.h:31,
from a.cc:18:
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h: In member function 'int Bitvector::rank(int, bool)':
/usr/lib/gcc/x86_64-... |
s182552307 | p03716 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#in... | In file included from /usr/lib/gcc/x86_64-linux-gnu/14/include/smmintrin.h:812,
from /usr/lib/gcc/x86_64-linux-gnu/14/include/nmmintrin.h:31,
from a.cc:18:
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h: In member function 'int Bitvector::rank(int, bool)':
/usr/lib/gcc/x86_64-... |
s831127407 | p03716 | C++ | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
template <class C>
struct SegmentTree {
struct Node {
Node operator+(const Node& o) const {
return *this < o ? *this :... | a.cc: In function 'int main()':
a.cc:51:36: error: cannot bind non-const lvalue reference of type 'SegmentTree<std::less<void> >::Node&' to an rvalue of type 'N0' {aka 'SegmentTree<std::less<void> >::Node'}
51 | SegmentTree<less<>> st0(n * 2, N0{ 1 << 30, 0 });
| ^~~~~~~~... |
s987820198 | p03716 | C++ | #include <iostream>
#include <sstream>
#include <string>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <numeric>
#include <iomanip>
using namespace std;
typed... | a.cc:55:22: error: 'v1' has not been declared
55 | add_uni_edge(v1, v2, cap);
| ^~
a.cc:55:26: error: 'v2' has not been declared
55 | add_uni_edge(v1, v2, cap);
| ^~
a.cc:55:30: error: 'cap' has not been declared
55 | add_uni_edg... |
s577242362 | p03716 | C++ | #import<bits/stdc++.h>
using namespace std;
typedef priority_queue<int> P;
int i, N, a[300000];
long long d[100000], m;
P q;
main(){
cin >> N;
for(; i < N * 3; ++i){
cin >> a[i];
q.push(-a[i]);
m += a[i];
if(i ^ N - 1){
*d = m;
}
if(N <= i && i < N * ... | a.cc:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
1 | #import<bits/stdc++.h>
| ^~~~~~
a.cc:8:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
8 | main(){
| ^~~~
a.cc: In function 'int main()':
a.cc:29:13: error: 'p' was not declared in this scope
... |
s195232737 | p03716 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <map>
using namespace std;
int main() {
cout << nn << endl;
long long int n;
cin >> n;
vector<long long int> a(3 * n);
vector<long long int> b, c;
priority_queue<long long int, vector<long long int>, great... | a.cc: In function 'int main()':
a.cc:11:17: error: 'nn' was not declared in this scope
11 | cout << nn << endl;
| ^~
|
s416532020 | p03716 | C++ | #include <climits>
#include <cstring>
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <functional>
#define fi first
#define se second
#define FO(x, n) for (int x = 0; x < n; ++x)
#define FOR(x, a, b) for (int x = a; x ... | a.cc: In function 'int main()':
a.cc:39:46: error: no type named 'value_type' in 'struct std::greater<long long int>'
39 | priority_queue<llong, greater<llong> > ql;
| ^
a.cc:39:46: error: template argument 3 is invalid
a.cc:47:16: error: request for member ... |
s037682134 | p03716 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
int main(void){
int N,res=0;
cin>>N;
vector<int> a(3*N);
rep(i,3*N)cin>>a[i];
for(int M=N;M<2*N;M++){
priority_queue<int,vector<int>,greater<int>> lq;
priority_queue<int> rq;
rep(i,N){
if(i<M)lq.push... | a.cc: In function 'int main()':
a.cc:23:24: error: no matching function for call to 'max(int&, ll)'
23 | res=max(res,suml-sumr);
| ~~~^~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc+... |
s067314142 | p03716 | C++ | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#de... | a.cc: In function 'int main()':
a.cc:81:17: error: 'accumulate' was not declared in this scope
81 | s1[0] = accumulate(t1.begin(), t1.begin() + n, 0ll);
| ^~~~~~~~~~
|
s885963073 | p03716 | C++ | oo#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if(1)
struct cww{cww(){
CIN_ONLY{
ios::sync_with_stdio(false);cin.tie(0);
}
}}star;
#define fin "\n"
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#de... | a.cc:1:3: error: stray '#' in program
1 | oo#include<bits/stdc++.h>
| ^
a.cc:1:1: error: 'oo' does not name a type; did you mean 'bool'?
1 | oo#include<bits/stdc++.h>
| ^~
| bool
a.cc: In constructor 'cww::cww()':
a.cc:8:9: error: 'ios' has not been declared
8 | ios::sync_with_st... |
s485030440 | p03716 | C++ | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<bitset>
#include<vector>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<iomanip>
#include <functional>
using namespace std;
typedef long long ll;
const int mod = 1000... | a.cc: In function 'int main()':
a.cc:36:19: error: 'LONG_MAX' was not declared in this scope
36 | ll ans = -LONG_MAX;
| ^~~~~~~~
a.cc:16:1: note: 'LONG_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
15 | #include <functional>
+++ |+... |
s045280715 | p03716 | C++ | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define INF_LL (ll)1e18
#define INF (int)1e9
#... | a.cc: In function 'int main()':
a.cc:222:34: error: expected ')' before ';' token
222 | sort(r.begin()+1, r.end(););
| ~ ^
| )
a.cc:222:35: error: expected primary-expression before ')' token
222 | sort(r.begin()+1, r.end();... |
s744449676 | p03716 | C++ | #include <iostream>
using namespace std;
pair<long long ,long long > arr[4001];
int main(){
int n; cin>>n;
int t=3*n;
for(int i=1;i<=t;i++){
cin>>arr[i].first;
arr[i].second=i;
}
sort(arr+1,arr+t+1);
long long ans=-2e18;
for(int L=n;L<=2*n;L++){
long long mx=0;
... | a.cc: In function 'int main()':
a.cc:11:5: error: 'sort' was not declared in this scope; did you mean 'short'?
11 | sort(arr+1,arr+t+1);
| ^~~~
| short
|
s568402370 | p03716 | C++ | a#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ll long long
#define int long long
#define ld double
using namespace std ;
const int MAXN = 101 * 1001 ;
int a[MAXN] ;
int32_t main()
{
ios::sync_with_stdio(0) ; cin.tie(0) ;
int n ;
cin >> n ;
n *= 3 ;
for(int i = 0 ... | a.cc:1:2: error: stray '#' in program
1 | a#include<bits/stdc++.h>
| ^
a.cc:1:1: error: 'a' does not name a type
1 | a#include<bits/stdc++.h>
| ^
a.cc:16:1: error: 'int32_t' does not name a type
16 | int32_t main()
| ^~~~~~~
a.cc:1:1: note: 'int32_t' is defined in header '<cstdint>'; this ... |
s267750630 | p03717 | C++ | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_... | a.cc: In function 'int main()':
a.cc:91:37: error: 'cnt' was not declared in this scope; did you mean 'int'?
91 | if (cnt[j] != cur) dp[i + 1][j] = 0;
| ^~~
| int
|
s243123630 | p03717 | C++ |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
template <uint32_t Modulus>
class modular {
public:
using value_type = uint32_t;
using max_type = uint64_t;
static constexpr value_type mod = Modulus;
static constexpr value_type mod_min = 1;
static constexpr v... | a.cc:8:11: error: 'uint32_t' has not been declared
8 | template <uint32_t Modulus>
| ^~~~~~~~
a.cc:11:22: error: 'uint32_t' does not name a type
11 | using value_type = uint32_t;
| ^~~~~~~~
a.cc:7:1: note: 'uint32_t' is defined in header '<cstdint>'; this is probably ... |
s396155584 | p03717 | C++ | #include <iostream>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P, int> PP;
const ll MOD = 1000000007;
ll dp[2][304][304];
int main()
{
int n, m;
cin >> n >> m;
PP p[304];
for(int i = 0; i < m; i++){
int l, r, x;
cin >> l >> r >> x;
p[i] =... | a.cc: In function 'int main()':
a.cc:21:5: error: 'sort' was not declared in this scope; did you mean 'short'?
21 | sort(p, p + m);
| ^~~~
| short
|
s482686385 | p03717 | Java | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.NoSuchElementException;
import java.util.function.IntBinaryOperator;
import java.util.function.UnaryOperator;
... | Main.java:12: error: package lib does not exist
import lib.MathUtil;
^
Main.java:28: error: cannot find symbol
int b1 = MathUtil.ceilExponent(n + 1);
^
symbol: variable MathUtil
location: class Main
Main.java:41: error: cannot find symbol
int bm = MathUtil.ceilExponent(m... |
s555963385 | p03717 | Java | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.NoSuchElementException;
import java.util.function.IntBinaryOperator;
import java.util.function.UnaryOperator;
... | Main.java:29: error: ';' expected
lrx[i][2] = In.ni()
^
1 error
|
s207924973 | p03717 | C++ | #include<bits/stdc++.h>
#define ll long long
using namespace std;
struct aaa{
int x,y,w;
}a[1010];
const int p=1e9+7;
vector<int>zh[1010];
int n,m,i,j,x,sz,k,l,ans,f[302][302][302];
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].w);
zh[a[i].y].push_back(i);
}
f[1][0][0... | a.cc: In function 'int main()':
a.cc:40:29: error: lvalue required as left operand of assignment
40 | for(k=0;k<=j;k++)ans=(ans+f[n][j][k])%=p;
| ~~~~^~~~~~~~~~~~
|
s944550335 | p03717 | C++ | LGY Will F**k The All Universe | a.cc:1:1: error: 'LGY' does not name a type
1 | LGY Will F**k The All Universe
| ^~~
|
s181034478 | p03717 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vpi;
typedef double dl;
#define mp make_pair
#define pb emplace_back
#define f first
#define s second
#define MOD 1e9+7
#define lb lower_bound
#define ub upper_bound
#define dst distance
... | a.cc:12:13: error: expected unqualified-id before numeric constant
12 | #define MOD 1e9+7
| ^~~
a.cc:20:4: note: in expansion of macro 'MOD'
20 | ll MOD = 1e9+7;
| ^~~
a.cc: In function 'int ask(int, int, int)':
a.cc:33:82: error: invalid operands of types 'int' and 'double' to binary '... |
s933240863 | p03717 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vpi;
typedef double dl;
#define mp make_pair
#define pb emplace_back
#define f first
#define s second
#define MOD 1e9+7
#define lb lower_bound
#define ub upper_bound
#define dst distance
... | a.cc: In function 'int ask(int, int, int)':
a.cc:32:82: error: invalid operands of types 'int' and 'double' to binary 'operator%'
32 | if(a!=b)return dp[n][a][b] = (ask(n+1,a,b) + ask(n+1,n,a) + ask(n+1,n,b))%MOD;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
... |
s413420128 | p03717 | C++ | dp[r][ma+1][b] += dp[r][g][b];
dp[r][g][ma+1] += dp[r][g][b];
dp[ma+1][g][b] %= mod;
dp[r][ma+1][b] %= mod;
dp[r][g][ma+1] %= mod;
}
}
}
ll ans = 0;
for (int r = 0; r <= N; r++) {
for (int g = 0; g <= N; g++) {
for (int b = 0; b <= N; b++) {
if (max(max(r, g), b) == N) {
ans ... | a.cc:1:33: error: 'dp' does not name a type
1 | dp[r][ma+1][b] += dp[r][g][b];
| ^~
a.cc:2:33: error: 'dp' does not name a type
2 | dp[r][g][ma+1] += dp[r][g][b];
| ^~
a.cc... |
s553425963 | p03717 | C++ | #include <bits/stdc++.h>
using namespace std;
#define dforsn(i,s,n) for(int i=int(n-1);i>=int(s);i--)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define dforn(i,n) dforsn(i,0,n)
#define forn(i,n) forsn(i,0,n)
#define all(a) a.begin(),a.end()
#define si(a) int((a).size())
#define pb emplace_back
#define mp ma... | a.cc: In function 'int main()':
a.cc:58:41: error: expected ';' before 'cin'
58 | ios_base::sync_with_stdio(0); cin.tie(0)
| ^
| ;
59 |
60 | cin >> n >> m;
| ~~~
|
s373987843 | p03717 | C | #include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long intl;
struct query{
int ini,fin,X;
void Leer()
{
scanf("%d %d %d",&ini,&fin,&X);
}
};
bool Cumple(query q, int r, int g, int b)
{
int x = 0;
if(q.ini<=r && r<=q.fin)
... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s953893788 | p03717 | C++ | #include<cstring>
#include<algorithm>
#include<vector>
#define mod 1000000007
using namespace std;
int dp[310][310][310];
bool visited[310][310][310];
int n, m;
int ma(int x, int y, int z) {
return max(max(x, y), z);
}
int func(int x, int y, int z) {
int &ret = dp[x][y][z];
if (ret != -1)return ret;
if (ma(x, y, z)... | a.cc: In function 'int main()':
a.cc:29:9: error: 'scanf' was not declared in this scope
29 | scanf("%d %d", &n, &m);
| ^~~~~
a.cc:65:9: error: 'printf' was not declared in this scope
65 | printf("%d\n", func(0, 0, 0));
| ^~~~~~
a.cc:4:1: note: 'printf' is defined in he... |
s233560903 | p03717 | C++ | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007)
#define l_ength size
void mul_mod(int& a, int b){
a *= b;
a %= MOD;
}
void add_mod(int& a, int b){
b += MOD;
a += b;
a %= MOD;... | a.cc: In function 'int main()':
a.cc:70:49: error: cannot bind non-const lvalue reference of type 'int&' to a value of type 'll' {aka 'long long int'}
70 | add_mod(ans,dp[i][j][k]);
| ^~~
a.cc:16:19: note: initializing ar... |
s718382299 | p03717 | C++ | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
b += MOD;
a += b;
a %= MOD;
}... | a.cc: In function 'int main()':
a.cc:73:53: error: cannot bind non-const lvalue reference of type 'll&' {aka 'long long int&'} to a value of type 'int'
73 | add_mod(dp[r+1][j][k],dp[i][j][k]);
| ~~~~~~~~~~~~^
a.cc:16:18: note: initializi... |
s286647217 | p03717 | C++ | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << end... | a.cc: In function 'int main()':
a.cc:55:52: error: cannot bind non-const lvalue reference of type 'll&' {aka 'long long int&'} to a value of type 'int'
55 | modadd(dp[r+1][j][k], dp[i][j][k]);
| ~~~~~~~~~~~~^
a.cc:26:17: note: initializin... |
s166617710 | p03717 | C++ | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAX 330
#define MOD 1000000007
inline int read()
{
int x=0;bool t=false;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')t=true,ch=getchar();
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return t?-x... | a.cc:18:1: error: 'vector' does not name a type
18 | vector<Node> e[MAX];
| ^~~~~~
a.cc: In function 'bool check(int, int, int)':
a.cc:22:23: error: 'e' was not declared in this scope
22 | for(int i=0,t=e[r].size();i<t;++i)
| ^
a.cc:25:17: error: 's' was not declared in t... |
s558535263 | p03717 | C++ | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define edge(v,a,b) v[a].pb(... | a.cc:17:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
17 | main(){
| ^~~~
a.cc: In function 'int main()':
a.cc:43:24: error: 's' was not declared in this scope
43 | if(s<=k){
| ^
a.cc:44:30: error: no post-increment operator f... |
s882752607 | p03717 | C++ | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m... | a.cc: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
a.cc:68:9: warning: no return statement in function returning non-void [-Wreturn-type]
68 | }
| ^
a.cc: In function 'int main()':
a.cc:158:33: error: no match for 'operator==' (operand types a... |
s165304989 | p03717 | C++ | #include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
... | a.cc: In function 'int main()':
a.cc:165:35: error: expected ';' before 'dp'
165 | dp[m+1][b][c]%=mod
| ^
| ;
166 | dp[a][m+1][c]+=dp[a][b][c]%mod;
| ~~
a.cc:167:35:... |
s457830813 | p03717 | C++ | #include <stdio.h>
#include <algorithm>
#include <vector>
const int P = 1000000007;
using namespace std;
struct otrezok {
int l, r, c;
};
otrezok o[512];
vector<otrezok> p[512];
bool operator < (otrezok a, otrezok b) {
if (a.r == b.r) return a.l < b.l;
return a.r < b.r;
}
int n, m;
int d[2][4][301][301];
int... | a.cc: In function 'int main()':
a.cc:56:17: error: 'memset' was not declared in this scope
56 | memset(d[cur], 0, sizeof(d[cur]));
| ^~~~~~
a.cc:4:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
3 | #include <vector... |
s417139491 | p03717 | C++ | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int n;
struct CHECK {
int l;
int r;
int x;
};
CHECK check_roules[301][300];
int m[301] = {0};
int c[301][301][301];
int new_... | a.cc: In function 'int main()':
a.cc:72:9: error: 'memset' was not declared in this scope
72 | memset(c, -1, sizeof(c));
| ^~~~~~
a.cc:11:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
10 | #include <algorithm>
+++ |+#include <cs... |
s359928763 | p03717 | C++ | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int n;
struct CHECK {
int l;
int r;
int x;
};
CHECK check_roules[301][300];
int m[301] = {0};
int c[301][301][301];
int new_... | a.cc: In function 'int main()':
a.cc:72:9: error: 'memset' was not declared in this scope
72 | memset(c, -1, sizeof(c));
| ^~~~~~
a.cc:11:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
10 | #include <algorithm>
+++ |+#include <cs... |
s620444982 | p03717 | C++ | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int n;
struct CHECK {
int l;
int r;
int x;
};
CHECK check_roules[301][300];
int m[301] = {0};
int c[301][301][301];
int new_... | a.cc: In function 'int main()':
a.cc:74:9: error: 'memset' was not declared in this scope
74 | memset(c, -1, sizeof(c));
| ^~~~~~
a.cc:11:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
10 | #include <algorithm>
+++ |+#include <cs... |
s864294953 | p03717 | C++ | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
#include <cstdlib>
#include <vector>
using namespace std;
const int maxn = 310;
const int mod = 1000000007;
vector<int> end[maxn];
int f[maxn][maxn][maxn];
set<int> s;
int l[maxn], r[maxn], x[maxn];
bool check(int r,int g, int b... | a.cc: In function 'bool check(int, int, int)':
a.cc:27:29: error: reference to 'end' is ambiguous
27 | for (int i=0;i<(int)end[k].size();i++)
| ^~~
In file included from /usr/include/c++/14/string:53,
from /usr/include/c++/14/bits/locale_classes.h:40,
... |
s405767859 | p03717 | C++ | #include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c)... | a.cc:68:27: error: macro "reppp" requires 3 arguments, but only 2 given
68 | reppp(j, N){
| ^
a.cc:15:9: note: macro "reppp" defined here
15 | #define reppp(i, m, n) for(int i=m;i<=n;i++)
| ^~~~~
a.cc: In function 'int main()':
a.cc:68:17: error: 'repp... |
s703950753 | p03717 | C++ | #include <iostream>
#include <vector>
using namespace std;
const int MAXN = 305;
const int MOD = 1000000007;
vector < pair<int,int> > A[MAXN];
int dp[MAXN][MAXN][MAXN];
void mod_add(int &x, int y)
{
x = (x + y)%MOD;
}
int main()
{
int n,m;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; ++i)
{
int ty, l, r;
sca... | a.cc: In function 'int main()':
a.cc:31:33: error: 'sort' was not declared in this scope; did you mean 'short'?
31 | sort(pos, pos+3);
| ^~~~
| short
|
s384240742 | p03717 | C++ | ♨♨♨♨♨♨♨♨♨♨
#include "bits/stdc++.h"
#define int ll
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1LL<<59)
const ll MOD = 1e9+7;
//0-index 半開区間セグツリー(値の更新or加算 , 最小値or最大値or和) ve... | a.cc:1:1: error: extended character ♨ is not valid in an identifier
1 | ♨♨♨♨♨♨♨♨♨♨
| ^
a.cc:1:1: error: extended character ♨ is not valid in an identifier
a.cc:1:1: error: extended character ♨ is not valid in an identifier
a.cc:1:1: error: extended character ♨ is not valid in an identifier
a.cc:1:1: error: ex... |
s641726489 | p03718 | C++ | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin(... | a.cc: In function 'int main()':
a.cc:113:9: error: no match for 'operator/' (operand types are 'P' {aka 'std::pair<long long int, long long int>'} and 'll' {aka 'long long int'})
113 | if(S/W==T/W||S%W==T%W) ans=-1;
| ~^~
| | |
| | ll {aka long long int}
| P {ak... |
s800939566 | p03718 | C++ | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctim... | a.cc: In function 'int main()':
a.cc:136:9: error: 'FF' was not declared in this scope
136 | FF flow(h+w+2);
| ^~
a.cc:144:33: error: 'flow' was not declared in this scope
144 | flow.add_edge(i, h+j, 1);
| ^~~~
a.cc:149:9: e... |
s788918829 | p03718 | C++ | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctim... | a.cc: In member function 'int Dinic::dfs(int, int, ll)':
a.cc:104:47: error: 'v' was not declared in this scope; did you mean 'vs'?
104 | if(e.cap > 0 && level[v] < level[e.to]){
| ^
| vs
|
s723271457 | p03718 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef std::pair<int, int> ii;
typedef tuple<int,int,int> i3;
typedef std::pair<int, ii> iii;
typedef std::vector<int> vi;
typedef std::vector<vi> vvi;
typedef std::vector<ii> vii;
typedef std::vector<iii> viii;
const int INF =... | a.cc: In function 'int main()':
a.cc:106:3: error: 'else' without a previous 'if'
106 | else cout<<G.calc_max_flow();
| ^~~~
|
s529141908 | p03718 | C++ | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 100005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline int read()
{
int x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1;... | /tmp/ccAmseN1.o: in function `__tcf_0':
a.cc:(.text+0x10): relocation truncated to fit: R_X86_64_PC32 against symbol `mp' defined in .bss section in /tmp/ccAmseN1.o
a.cc:(.text+0x17): relocation truncated to fit: R_X86_64_PC32 against symbol `mp' defined in .bss section in /tmp/ccAmseN1.o
/tmp/ccAmseN1.o: in function `... |
s105559237 | p03718 | C++ | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <limits.h>
#include <cmath>
#include <map>
using namespace std;
using ll=long long;
#define int long long
const int INF=INT_MAX/3;
struct edge{
int to,cap,rev;
};
vector<edge> G[210];
vector<bool... | cc1plus: error: '::main' must return 'int'
|
s639041070 | p03718 | C++ | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <limits>
#ifdef DEBU... | a.cc: In member function 'bool Dinic<T, INF>::bfs(int, int)':
a.cc:52:47: error: expected ')' before 'jj'
52 | Gf.assign(n,std::vector<int>()jj);
| ^~
a.cc:52:26: note: to match this '('
52 | Gf.assign(n,std::vector<int>()jj);
... |
s805152943 | p03718 | C++ | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <limits>
#ifdef DEBU... | a.cc: In member function 'T Dinic<T, INF>::dfs(int, T, const int&)':
a.cc:76:28: error: 'max_flow' was not declared in this scope
76 | if(max_flow==0) break;
| ^~~~~~~~
|
s688007333 | p03718 | C++ | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <limits>
#ifdef DEBU... | a.cc: In member function 'bool Dinic<T, INF>::bfs(int, int)':
a.cc:52:26: error: no matching function for call to 'std::vector<std::vector<int> >::assign(int&)'
52 | Gf.assign(n);
| ~~~~~~~~~^~~
In file included from /usr/include/c++/14/vector:66,
from a.cc:4:
/... |
s870866535 | p03718 | C++ | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <limits>
#ifdef DEBU... | a.cc: In member function 'bool Dinic<T>::bfs(int, int)':
a.cc:55:26: error: no matching function for call to 'std::vector<std::vector<int> >::assign(int&, int)'
55 | Gf.assign(n,0);
| ~~~~~~~~~^~~~~
In file included from /usr/include/c++/14/vector:66,
from a.cc:... |
s820329381 | p03718 | C++ | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define reps(i,n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i,n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i,n) for (int i = (int)(n); i > 0; --i)
#define loop(i,x,n) for (int i = (int)(x); i < (n); ++i)
#define loops(i,x,n... | a.cc:29:28: error: expected nested-name-specifier before 'T'
29 | template<class T, typename T INF>
| ^
a.cc:29:30: error: expected '>' before 'INF'
29 | template<class T, typename T INF>
| ^~~
a.cc: In function 'void solve()':
a.cc:97:19: error:... |
s556470923 | p03718 | C++ | #include <bits/stdc++.h>
using namespace std;
struct Template_MPM{
struct FlowEdge{
int v, u;
long long cap, flow;
FlowEdge(){}
FlowEdge(int _v, int _u, long long _cap, long long _flow)
: v(_v), u(_u), cap(_cap), flow(_flow){}
FlowEdge(int _v, int _u, long long ... | a.cc:38:5: error: ISO C++ forbids declaration of 'TEmplate_MPM' with no type [-fpermissive]
38 | TEmplate_MPM(){}
| ^~~~~~~~~~~~
a.cc: In member function 'int Template_MPM::TEmplate_MPM()':
a.cc:38:20: warning: no return statement in function returning non-void [-Wreturn-type]
38 | TEmplate_MPM(... |
s051669435 | p03718 | C++ | #include <bits/stdc++.h>
using namespace std;
struct Template_MPM{
struct FlowEdge{
int v, u;
long long cap, flow;
FlowEdge(){}
FlowEdge(int _v, int _u, long long _cap, long long _flow)
: v(_v), u(_u), cap(_cap), flow(_flow){}
FlowEdge(int _v, int _u, long long ... | a.cc:38:5: error: ISO C++ forbids declaration of 'MPM' with no type [-fpermissive]
38 | MPM(){}
| ^~~
a.cc: In member function 'int Template_MPM::MPM()':
a.cc:38:11: warning: no return statement in function returning non-void [-Wreturn-type]
38 | MPM(){}
| ^
|
s521294852 | p03718 | C++ | include<bits/stdc++.h>
#define LL long long
#define MEM(x,y) memset(x,y,sizeof(x))
#define MOD(x) ((x)%mod)
#define mod 1000000007
#define pb push_back
#define STREAM_FAST ios::sync_with_stdio(false)
using namespace std;
const int maxn = 2e5+7;
struct node {int v,flow,nxt;}e[maxn];
int tot=1,head[maxn],dep[maxn];
// ... | a.cc:1:1: error: 'include' does not name a type
1 | include<bits/stdc++.h>
| ^~~~~~~
a.cc: In function 'bool bfs(int, int)':
a.cc:3:18: error: 'memset' was not declared in this scope
3 | #define MEM(x,y) memset(x,y,sizeof(x))
| ^~~~~~
a.cc:23:5: note: in expansion of macro 'MEM'
... |
s135566820 | p03718 | C++ | //Zory-2020
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#... | a.cc: In function 'int mine::dfs(int, int)':
a.cc:85:27: error: 'cur' was not declared in this scope
85 | if(e[k].c==0) cur[x]=e[k].g;
| ^~~
|
s254431547 | p03718 | C++ | #include <bits/stdc++.h>
#define REP(i, n) for(int i=0;i<(n);++i)
#define RREP(i, n) for(int i=1;i<=(n);++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define DUMP(x) cout<<#x<<"="<<(x)<<endl;
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long lint;
... | /usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x17): undefined reference to `main'
collect2: error: ld returned 1 exit status
|
s904620215 | p03718 | C++ | //const int F = 10001;
//void _(){
// int n,m;
// cin >> n >> m;
// vs grid(n);
// cin >> grid;
// MaxFlow mf;
// rep(i,0,n-1)
// rep(j,0,m-1){
// if(grid[i][j] == '.') continue;
// mf.add_edge(i*m+j,i*m+j+n*m,1);
// rep(k,0,n-1){
// if(grid[i][j]... | a.cc:129:27: error: 'numeric_limits' was not declared in this scope
129 | MaxFlow(int _source = numeric_limits<int>::min(), int _sink = numeric_limits<int>::min() + 1):source(_source), sink(_sink){
| ^~~~~~~~~~~~~~
a.cc:129:42: error: expected primary-expression before 'int'
129 ... |
s204483102 | p03718 | C++ | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath> // 変数名にy1が使えなくなるかも…。
#include <map>
#include <unordered_map>
... | a.cc: In member function 'int64_t Directed_Graph::dfs_increase_path(int, int, int64_t, std::vector<bool>&, adj_list&, const std::vector<std::vector<int> >&) const':
a.cc:152:60: error: no matching function for call to 'min(const int64_t&, int128_t&)'
152 | int d = dfs_increase_path(e.to, t, std::min(f... |
s208524712 | p03718 | C++ | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath> // 変数名にy1が使えなくなるかも…。
#include <map>
#include <unordered_map>
... | a.cc: In member function 'std::vector<std::vector<long long int> > Directed_Graph::Warshall_Floyd(long long int)':
a.cc:88:41: error: no matching function for call to 'min(__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type&, int64_t&)'
88 | dist[i][e.to] = std::min(di... |
s077746594 | p03718 | C++ | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)
#define pb push_back
using namespa... | a.cc: In member function 'bool D::bfs()':
a.cc:28:57: error: 'o' was not declared in this scope
28 | memset(vis,0,sizeof(vis));memset(d,0,sizeof(d));o..o....So
| ^
a.cc:28:59: error: expected unqualified-id before '.' token
28 | memset(... |
s391721871 | p03718 | C++ | #include <bits/stdc++.h>
using namespace std;
template<typename T>
class fixed_point : T {
public:
explicit constexpr fixed_point (
T&& t
) noexcept
: T(forward<T>(t))
{
}
template<typename... Args>
constexpr decltype(auto)
operator()(
Args&&... args
) con... | a.cc: In function 'int main()':
a.cc:40:13: error: expected primary-expression before ';' token
40 | return -;
| ^
|
s625631382 | p03718 | C++ | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<queue>
#include<cstring>
using namespace std;
const int maxn=1e4+5;
const int maxm=4e4+5;
const int inf=1e9;
int k,l,p,q,maxx;
struct edge
{
int fr,to,nxt;
int c,f;
}graph[maxm];
int head[maxn];
int tot;
int level[maxn];
int n,m;
int... | a.cc: In function 'int main()':
a.cc:128:41: error: reference to 'end' is ambiguous
128 | end.x=a[cnt].x,end.y=a[cnt].y,end.id=a[cnt].id;
| ^~~
In file included from /usr/include/c++/14/string:53,
from /usr/include/... |
s040796759 | p03718 | C++ | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+5;
const int maxm=4e4+5;
const int inf=1e9;
int k,l,p,q,maxx;
struct edge
{
int fr,to,nxt;
int c,f;
}graph[maxm];
int head[maxn];
int tot;
int level[maxn];
int n,m;
int s,t;
string str;
struct node
{
int x,y,id;
}a[maxn],start,end;
bool cmp(node a,n... | a.cc: In function 'int main()':
a.cc:123:41: error: reference to 'end' is ambiguous
123 | end.x=a[cnt].x,end.y=a[cnt].y,end.id=a[cnt].id;
| ^~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:166,
... |
s401737043 | p03718 | C++ | #include<iostream>
#include<ctime>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<climits>
#include<cstring>
#include<iomanip>
#include<string>
#include<bitset>
#include<unordered_map>
#include<unordered_set>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#incl... | a.cc:22:9: fatal error: windows.h: No such file or directory
22 | #include<windows.h>
| ^~~~~~~~~~~
compilation terminated.
|
s715207804 | p03718 | C++ | #include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long long... | a.cc: In function 'int fordFulkerson(int (*)[202], int, int)':
a.cc:74:25: error: 'INT_MAX' was not declared in this scope
74 | int path_flow = INT_MAX;
| ^~~~~~~
a.cc:13:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'... |
s730295973 | p03718 | C++ | #include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long long... | a.cc: In function 'bool bfs(int (*)[202], int, int, int*)':
a.cc:37:5: error: 'memset' was not declared in this scope
37 | memset(visited, 0, sizeof(visited));
| ^~~~~~
a.cc:13:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
12 | #include <... |
s023235225 | p03718 | C++ | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define min(x,y) ((x)<(y)?(x):(y))
using namespace std;
const int maxn=3e6+5;
int fi[maxn],ne[maxn*2],dui[maxn*2],dui1[maxn*2],qc[maxn];
int a[105][105],de[20005],h[maxn];
char s[105];
int i,j... | a.cc:87:1: error: expected unqualified-id before '--' token
87 | ---------------------
| ^~
|
s144528799 | p03718 | Java | import java.util.*;
public class edge {
int to;
int cap;
int rev;//逆辺にアクセスする
edge(int to,int cap,int rev){
this.to =to;
this.cap =cap;
this.rev =rev;
}
}
public class Main {
static final int INF=Integer.MAX_VALUE;
static boolean[] used;
static int flow;
static int V;//頂点
static int E;//辺
sta... | Main.java:3: error: class edge is public, should be declared in a file named edge.java
public class edge {
^
1 error
|
s248687773 | p03718 | Java | public class edge {
int to;
int cap;
int rev;//逆辺にアクセスする
edge(int to,int cap,int rev){
this.to =to;
this.cap =cap;
this.rev =rev;
}
}
public class Main {
static final int INF=Integer.MAX_VALUE;
static boolean[] used;
static int flow;
static int V;//頂点
static int E;//辺
static int H;
static in... | Main.java:1: error: class edge is public, should be declared in a file named edge.java
public class edge {
^
Main.java:30: error: cannot find symbol
static List<List<edge>> G;//list?????????????
^
symbol: class List
location: class Main
Main.java:30: error: cannot find symbol
static List<List<edg... |
s364251088 | p03718 | C++ | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i... | a.cc: In member function 'int Dinic::max_flow(int, int)':
a.cc:80:37: error: expected ')' before 'flow'
80 | while((f=dfs(s,t,inf)>0)flow+=f;
| ^~~~
a.cc:80:18: note: to match this '('
80 | while((f=dfs(s,t,inf)>0)flow+=f;
| ... |
s161843854 | p03718 | C++ | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<vector>
#include<string.h>
#include<math.h>
#include<stdio.h>
#include<queue>
#include<utility>
#include<cstdio>
#include<cstring>
#include<new>
#include<new.h>
#include<float.h>
#include<ctype.h>
#inclu... | a.cc:16:9: fatal error: new.h: No such file or directory
16 | #include<new.h>
| ^~~~~~~
compilation terminated.
|
s873371556 | p03718 | C++ | use std::io::*;
use std::str::FromStr;
#[allow(dead_code)]
fn read<T: FromStr>() -> T {
let stdin = stdin();
let stdin = stdin.lock();
let token: String = stdin
.bytes()
.map(|c| c.expect("failed to read char") as char)
.skip_while(|c| c.is_whitespace())
.take_while(|c| !c.i... | a.cc:4:2: error: invalid preprocessing directive #[
4 | #[allow(dead_code)]
| ^
a.cc:18:2: error: invalid preprocessing directive #[
18 | #[allow(dead_code)]
| ^
a.cc:19:2: error: invalid preprocessing directive #[
19 | #[derive(Clone, Debug, Eq, PartialEq)]
| ^
a.cc:26:2: error: invalid ... |
s249241462 | p03718 | C | #include<bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
int H,W;
char str[102];
int Sx,Sy,Tx,Ty;
int fk[101][101];
int h[100001],nxt[100001],to[100001],w[100001],tot=-1;
void ins(int x,int y,int z){nxt[++tot]=h[x];to[tot]=y;w[tot]=z;h[x]=tot;}
void insw(int x,int y,int z1,int z2){ins(x,y,z1);ins(y,x,z2);... | main.c:1:9: fatal error: bits/stdc++.h: No such file or directory
1 | #include<bits/stdc++.h>
| ^~~~~~~~~~~~~~~
compilation terminated.
|
s898704870 | p03718 | C | /*
cat <<EOF >mistaken-paste
*/
#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <time.h>
#define BIG 2000000007
#define VERYBIG 200000000000007LL
#de... | main.c:286:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '<' token
286 | typedef pair<ull, ull> P;
| ^
|
s716001040 | p03718 | C++ | #define HMAX 102
#define WMAX 10210 10
.o...o..o.
....o.....
....oo.oo.
..oooo..o.
....oo....
..o..o....
o..o....So
o....T....
....o.....
........oo | a.cc:3:1: error: expected unqualified-id before '.' token
3 | .o...o..o.
| ^
|
s323451540 | p03718 | C++ | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<cstdlib>
#define cmax(a,b) (a<(b)?a=(b),1:0)
#define cmin(a,b) (a>(b)?a=(b),1:0)
#define dmin(a,b) ((a)<(b)?(a):(b))
#define dmax(a,b) ((a)>(b)?(a):(b))
#define regsiter register
#define CL fclose(stdin),fclose(stdout)
names... | a.cc: In function 'bool bfs()':
a.cc:60:34: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
60 | for(register int p=e[q[hq]].next;p;p=e[p].next)
| ^
a.cc: In function 'int dfs(int, int)':
a.cc:69:26: warning: ISO C++17 does not ... |
s751391317 | p03718 | Java | import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.Optional;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args){
Main main = n... | Main.java:278: error: ';' expected
passed[from] = true
^
1 error
|
s310792597 | p03718 | C++ | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#include<random>
#pragma warning(disable:4996)
using namespace std;
#define _GLIBCXX_DEBUG
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(auto i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), ... | a.cc: In function 'int main()':
a.cc:135:27: error: expected ';' before 'cout'
135 | if(ans>1000)ans=-1
| ^
| ;
136 | cout<<ans<<endl;
| ~~~~
|
s757290157 | p03718 | C++ | #include<stdio.h>
#include<string.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<math.h>
#include<queue>
#include<functional>
#include<limits.h>
#include<string.h>
#include<set>
using namespace std;
#define P pair<int,in... | a.cc:24:1: error: extended character is not valid in an identifier
24 |
| ^
a.cc:30:1: error: extended character is not valid in an identifier
30 |
| ^
a.cc:34:1: error: extended character is not valid in an identifier
34 |
| ^
a.cc:42:1: error: extended character is not valid i... |
s452237171 | p03718 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
const int N=3e2+5;
const ll inf=2e15;
const ll mod=1e9+7;
//题意:n*m地图 n,m<=100,起点S,终点T 'o'表示叶子,每次可以跳到同行或者同列的'o'上,问最少删掉多少个'o'使得S无法到达T?
//最小割模型,先把图变为二分图,每行每列加上源点和汇点,两边点分别为1~n,1~m
//对叶子'o'(x,y):x-y连接一条边 表示第x行的叶子可以跳到第y列 容量为1:表示删除(... | a.cc: In function 'll bfs()':
a.cc:52:23: error: reference to 'end' is ambiguous
52 | if(t==end)
| ^~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:166,
from a.cc:1:
/usr/include/c++/14/valarray:1265:5: note: candidates are: 'te... |
s392487876 | p03718 | C++ | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq... | a.cc: In member function 'void Dinic::bfs(int)':
a.cc:37:5: error: 'memset' was not declared in this scope
37 | memset(level, -1, sizeof(level));
| ^~~~~~
a.cc:11:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
10 | #include <iomanip>
+++... |
s896510277 | p03718 | C++ | #include<cstdio>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
const int inf=1050000000;
const int maxn=217;
const int maxm=20500;
char c;
int n,m,s,t,u,v,w,h,y,edge_cnt=1;
int cur[maxn],first[maxn],next[maxm],to[maxm],r[maxm],d[maxn];
queue <int> q;
void addedge(int u,int v,int w) {
++ed... | a.cc: In function 'void addedge(int, int, int)':
a.cc:15:9: error: reference to 'next' is ambiguous
15 | next[edge_cnt]=first[u];
| ^~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:66,
from /usr/include/c++/14/deque:62,
from /usr/include/c++/1... |
s599413785 | p03718 | C++ | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int inf=30000;
int edge[30000],next[30000],flow[30000],first[300];
int g[300],h[300];
char c[300][300];
int i,j,m,n,s,head,tail,sum_edge;
inline void addedge(int x,int y,int f)
{
sum_edge++,edge[sum_edge]=y,flow[sum_edge]=f,next[s... | a.cc: In function 'void addedge(int, int, int)':
a.cc:16:54: error: reference to 'next' is ambiguous
16 | sum_edge++,edge[sum_edge]=y,flow[sum_edge]=f,next[sum_edge]=first[x],first[x]=sum_edge;
| ^~~~
In file included from /usr/include/c++/14/bits/st... |
s239962196 | p03718 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
#define X first
#define Y second
const int M=3e4+10;
const int inf=1e9;
const int MOD=1e9+7;
priority_queue <int> pq;
struct maxflow{
int m;
int st,en;
int v[M][2],flow[M][2],cap[M];
int f[M],tr[M];
... | a.cc:39:11: error: 'N' was not declared in this scope
39 | int q[N];
| ^
a.cc: In member function 'bool maxflow::BFS(int)':
a.cc:44:9: error: 'q' was not declared in this scope; did you mean 'pq'?
44 | q[1]=st;
| ^
| pq
|
s750267845 | p03718 | C++ | 10 10
.o...o..o.
....o.....
....oo.oo.
..oooo..o.
....oo....
..o..o....
o..o....So
o....T....
....o.....
........oo | a.cc:1:1: error: expected unqualified-id before numeric constant
1 | 10 10
| ^~
|
s525145898 | p03718 | C++ | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int H, W;
char fiel... | a.cc: In member function 'void Dinic::add_edge(int, int, int)':
a.cc:61:49: warning: narrowing conversion of '(&((Dinic*)this)->Dinic::G.std::vector<std::vector<Dinic::edge> >::operator[](((std::vector<std::vector<Dinic::edge> >::size_type)to)))->std::vector<Dinic::edge>::size()' from 'std::vector<Dinic::edge>::size_ty... |
s372444326 | p03718 | C++ | #include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
const int inf=1050000000;
int h,w,s,t,edge_cnt=1,xs,xt,ys,yt;
char c[110][110];
int ans,n,first[10007],d[10007],cur[10007],next[2000010],r[2000010],too[2000010];
int num(int x,int y){
return (x-1) * h + y;
}
queue <int> q;
void addedge(int u,i... | a.cc: In function 'void addedge(int, int)':
a.cc:15:9: error: reference to 'next' is ambiguous
15 | next[edge_cnt]=first[u];
| ^~~~
In file included from /usr/include/c++/14/string:47,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/... |
s119895288 | p03718 | C++ | #include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
const int inf=1050000000;
int h,w,s,t,edge_cnt=1,xs,xt,ys,yt;
char c[110][110];
int ans,n,first[10007],d[10007],cur[10007],next[2000010],r[2000010],too[2000010];
int num(int x,int y){
return (x-1) * h + y;
}
queue <int> q;
void addedge(int u,i... | a.cc: In function 'void addedge(int, int)':
a.cc:15:9: error: reference to 'next' is ambiguous
15 | next[edge_cnt]=first[u];
| ^~~~
In file included from /usr/include/c++/14/string:47,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/... |
s159176696 | p03718 | C++ | #include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
//#include<map>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define po... | a.cc: In function 'int max_flow(int, int)':
a.cc:54:17: error: 'memset' was not declared in this scope
54 | memset(used,0,sizeof(used));
| ^~~~~~
a.cc:9:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
8 | #include<c... |
s244606584 | p03718 | C++ | #include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <queue>
#include <cmath>
#define read(X) scanf("%d",&X);
#define readLL(X) cin>>X;
#define readN(N,a) for(int i=0;i<N;i++)scanf("%lld",&a[i]);
#defi... | a.cc: In function 'void add(int, int, int)':
a.cc:37:5: error: reference to 'prev' is ambiguous
37 | { prev[e] = last[x];
| ^~~~
In file included from /usr/include/c++/14/string:47,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base... |
s977322746 | p03718 | C++ | #include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;
#define... | a.cc: In function 'int main()':
a.cc:99:17: error: 'gets' was not declared in this scope; did you mean 'getw'?
99 | gets(tmp);
| ^~~~
| getw
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.